×

Location of cross-docking centers and vehicle routing scheduling under uncertainty: a fuzzy possibilistic-stochastic programming model. (English) Zbl 1427.90067

Summary: The location of multiple cross-docking centers (CDCs) and vehicle routing scheduling are two crucial choices to be made in strategic/tactical and operational decision levels for logistics companies. The choices lead to more realistic problem under uncertainty by covering the decision levels in cross-docking distribution networks. This paper introduces two novel deterministic mixed-integer linear programming (MILP) models that are integrated for the location of CDCs and the scheduling of vehicle routing problem with multiple CDCs. Moreover, this paper proposes a hybrid fuzzy possibilistic-stochastic programming solution approach in attempting to incorporate two kinds of uncertainties into mathematical programming models. The proposed solving approach can explicitly tackle uncertainties and complexities by transforming the mathematical model with uncertain information into a deterministic model. \(m'\) imprecise constraints are converted into \(2Rm'\) precise inclusive constraints that agree with \(R\alpha\)-cut levels, along with the concept of feasibility degree in the objective functions based on expected interval and expected value of fuzzy numbers. Finally, several test problems are generated to appraise the applicability and suitability of the proposed new two-phase MILP model that is solved by the developed hybrid solution approach involving a variety of uncertainties and complexities.

MSC:

90B10 Deterministic network models in operations research
90B06 Transportation, logistics and supply chain management
90C70 Fuzzy and other nonstochastic uncertainty mathematical programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Waller, M. A.; Cassady, C. R.; Ozment, J., Impact of cross-docking on inventory in a decentralized retail supply chain, Transp. Res. E, 42, 359-382 (2006)
[2] Chen, P.; Guo, Y.; Lim, A.; Rodrigues, B., Multiple crossdocks with inventory and time windows, Comput. Oper. Res., 33, 1, 43-63 (2006) · Zbl 1089.90007
[3] Lee, K.; Kim, B. S.; Joo, C. M., Genetic algorithms for door-assigning and sequencing of trucks at distribution centers for the improvement of operational performance, Expert Syst. Appl., 39, 12975-12983 (2012)
[4] Yeung, L.; Lee, C. K.M., Adoption of genetic algorithm for cross-docking scheduling with time window, Decis. Making Supply Chain Integr. Decis. Eng., 1, 1-22 (2012)
[5] Cóccola, M. E.; Méndez, C. A.; Zamarripa, M.; Espuña, A., Integrated production and distribution management with cross docking in supply chains, Comput. Aided Chem. Eng., 31, 1050-1054 (2012)
[6] Konur, D.; Golias, M. M., Cost-stable truck scheduling at a cross-dock facility with unknown truck arrivals: a meta-heuristic approach, Transp. Res. E, 49, 71-91 (2013)
[7] Liao, T. W.; Egbelu, P. J.; Chang, P. C., Simultaneous dock assignment and sequencing of inbound trucks under a fixed outbound truck schedule in multi-door cross docking operations, Int. J. Prod. Econ., 141, 212-229 (2013)
[8] Joo, C. M.; Kim, B. S., Scheduling compound trucks in multi-door cross-docking terminals, Int. J. Adv. Manuf. Technol., 64, 977-988 (2013)
[9] Sung, C. S.; Song, S. H., Integrated service network design for a cross-docking supply chain network, J. Oper. Res. Soc., 54, 12, 1283-1295 (2003) · Zbl 1203.90034
[11] Musa, R.; Arnaout, J. P.; Jung, H., Ant colony optimization algorithm to solve for the transportation problem of cross-docking network, Comput. Ind. Eng., 59, 1, 85-92 (2010)
[12] Sung, C. S.; Yang, W., An exact algorithm for a cross-docking supply chain network design problem, J. Oper. Res. Soc., 59, 119-136 (2008) · Zbl 1167.90405
[13] Gümüs, M.; Bookbinder, J. H., Cross-docking and it simplifications in location-distribution systems, J. Bus. Logistics, 25, 2, 199-228 (2004)
[14] Jayaraman, V.; Ross, A., A simulated annealing methodology to distribution network design and management, Eur. J. Oper. Res., 144, 629-645 (2003) · Zbl 1012.90531
[15] Ross, A.; Jayaraman, V., An evaluation of new heuristics for the location of cross-docks distribution centers in supply chain network design, Comput. Ind. Eng., 55, 64-79 (2008)
[16] Bachlaus, M.; Pandey, M. K.; Mahajan, C.; Shankar, R.; Tiwari, M. K., Designing an integrated multi-echelon agile supply chain network: a hybrid taguchi-particle swarm optimization approach, J. Intell. Manuf., 19, 6, 747-761 (2008)
[17] Lee, Y. H.; Jung, J. W.; Lee, K. M., Vehicle routing scheduling for cross-docking in the supply chain, Comput. Ind. Eng., 51, 2, 247-256 (2006)
[18] Liao, C. J.; Lin, Y.; Shih, S. C., Vehicle routing with cross-docking in the supply chain, Expert Syst. Appl., 37, 10, 6868-6873 (2010)
[19] Wen, M.; Larsen, J.; Clausen, J.; Cordeau, J. F.; Laporte, G., Vehicle routing with cross-docking, J. Oper. Res. Soc., 60, 12, 1708-1718 (2009) · Zbl 1196.90027
[20] Liu, L.; Huang, G. H.; Liu, Y.; Fuller, G. A.; Zeng, G. M., A fuzzy-stochastic robust programming model for regional air quality management under uncertainty, Eng. Optim., 35, 2, 177-199 (2003)
[21] Jimenez, M.; Arenas, M.; Bilbao, A.; Rodriguez, M. V., Linear programming with fuzzy parameters: an interactive method resolution, Eur. J. Oper. Res., 177, 1599-1609 (2007) · Zbl 1102.90345
[22] Pishvaee, M. S.; Torabi, S. A., A possibilistic programming approach for closed-loop supply chain network design under uncertainty, Fuzzy Sets Syst., 161, 2668-2683 (2010) · Zbl 1230.90204
[23] Soyster, A. L., Convex programming with set-inclusive constraints: applications to inexact linear programming, Oper. Res., 21, 1154-1157 (1973) · Zbl 0266.90046
[24] Leung, Y., Spatial Analysis and Planning Under Imprecision (Studies in Regional Science and Urban Economics) (1988), Elsevier Science Publishers: Elsevier Science Publishers Amsterdam, The Netherlands · Zbl 0663.90019
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.