Synchronization in Vehicle Routing—A Survey of VRPs with Multiple Synchronization Constraints

References

• Aldaihani M., Dessouky M. Hybrid scheduling methods for paratransit operations. Comput. Indust. Engrg. (2003) 45(1):75–96Crossref, Google Scholar
• Amaya A., Langevin A., Trépanier M. The capacitated arc routing problem with refill points. Oper. Res. Lett. (2007) 35(1):45–53Crossref, Google Scholar
• Amaya C., Langevin A., Trépanier M. A heuristic method for the capacitated arc routing problem with refill points and multiple loads. J. Oper. Res. Soc. (2010) 61(7):1095–1103Crossref, Google Scholar
• Ambrosino D., Scutellà M. Distribution network design: New problems and related models. Eur. J. Oper. Res. (2005) 165(3):610–624Crossref, Google Scholar
• Andersen J., Crainic T., Christiansen M. Service network design with management and coordination of multiple fleets. Eur. J. Oper. Res. (2009) 193(2):377–389Crossref, Google Scholar
• Andersson H., Hoff A., Christiansen M., Hasle G., Løkketangen A. Industrial aspects and literature survey: Combined inventory management and routing. Comput. Oper. Res. (2010) 37(9):1515–1536Crossref, Google Scholar
• Angelelli E., Speranza M. The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. (2002) 137(2):233–247Crossref, Google Scholar
• Anily S., Hassin R. The swapping problem. Networks (1992) 22(4):419–433Crossref, Google Scholar
• Archetti C., Speranza M., Golden B., Raghavan S., Wasil E. The split delivery vehicle routing problem: A survey. The Vehicle Routing Problem: Latest Advances and New Challenges (2008) (Springer, New York) 103–122Crossref, Google Scholar
• Baker H., Franz L., Sweigart J. Coordinated transportation systems: An alternative approach to traditional independent systems. Eur. J. Oper. Res. (1993) 66(3):341–352Crossref, Google Scholar
• Bélanger N., Desaulniers G., Soumis F., Desrosiers J. Periodic airline fleet assignment with time windows, spacing constraints and time dependent revenues. Eur. J. Oper. Res. (2006) 175(3):1754–1766Crossref, Google Scholar
• Berning B. Die optimale Verplanung von Transporten bei interdependenten Ressourcen am Beispiel des Advanced-Truckload-Konzeptes. (2009) . Master's thesis, School of Sciences, University of Erlangen-NurembergGoogle Scholar
• Boccia M., Crainic T., Sforza A., Sterle C., Festa P. A metaheuristic for a two echelon location-routing problem. Experimental Algorithms, Vol. 6049 of Lecture Notes in Computer Science (2010) (Springer, Berlin) 288–301Google Scholar
• Bochtis D., Sørensen C. The vehicle routing problem in field logistics: Part I. Biosystems Engineering (2009) 104(4):447–457Crossref, Google Scholar
• Bochtis D., Sørensen C. The vehicle routing problem in field logistics: Part II. Biosystems Engineering (2010) 105(2):180–188Crossref, Google Scholar
• Bock S. Real-time control of freight forwarder transportation networks by integrating multimodal transport chains. Eur. J. Oper. Res. (2010) 200(3):733–746Crossref, Google Scholar
• Bordenave C., Gendreau M., Laporte G. Heuristics for the mixed swapping problem. Comput. Oper. Res. (2010) 37(1):108–114Crossref, Google Scholar
• Bredström D., Rönnqvist M. Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur. J. Oper. Res. (2008) 191(1):19–29Crossref, Google Scholar
• Brucker P.Scheduling Algorithms (2007) (Springer, Berlin) Google Scholar
• Brucker P., Knust S.Complex Scheduling (2006) (Springer, Berlin) Google Scholar
• Bullo F., Cortés J., Martínez S.Distributed Control of Robotic Networks (2009) (Princeton University Press, Princeton, NJ) Google Scholar
• Bürckert H., Fischer K., Vierke G. Holonic transport scheduling with TELETRUCK. Applied Artificial Intelligence (2000) 14(7):697–725Crossref, Google Scholar
• Campbell A., Clarke L., Kleywegt A., Savelsbergh M., Crainic T., Laporte G. The inventory routing problem. Fleet Management and Logistics (1998) (Kluwer, Boston) 95–113Crossref, Google Scholar
• Caprara A., Kroon L., Monaci M., Peeters M., Toth P., Barnhart C., Laporte G. Passenger railway optimization. Transportation, Vol. 14 of Handbooks in Operations Research and Management Science (2007) (Elsevier, Amsterdam) 129–187Google Scholar
• Caris A., Macharis C., Janssens G. Planning problems in intermodal freight transport: Accomplishments and prospects. Transportation Planning Tech. (2008) 31(3):277–302Crossref, Google Scholar
• Chao I. A tabu search method for the truck and trailer routing problem. Comput. Oper. Res. (2002) 29(1):33–51Crossref, Google Scholar
• Chen S., Golden B., Wasil E. The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results. Networks (2007) 49(4):318–329Crossref, Google Scholar
• Cheung R., Shi N., Powell W., Simão H. An attribute-decision model for cross-border drayage problem. Transportation Res. Part E (2008) 44(2):217–234Crossref, Google Scholar
• Christiansen C., Lysgaard J. A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. Lett. (2007) 35(6):773–781Crossref, Google Scholar
• Christiansen M., Fagerholt K., Nygreen B., Ronen D., Barnhart C., Laporte G. Maritime transportation. Transportation, Vol. 14 of Handbooks in Operations Research and Management Science (2007) (Elsevier, Amsterdam) 189–284Google Scholar
• Christofides N., Eilon S. An algorithm for the vehicle-dispatching problem. Oper. Res. Quart. (1969) 20(3):309–318Crossref, Google Scholar
• Chung H., Norback J. A clustering and insertion heuristic applied to a large routing problem in food distribution. J. Oper. Res. Soc. (1991) 42(7):555–564Google Scholar
• Cordeau J., Gendreau M., Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks (1997) 30(2):105–119Crossref, Google Scholar
• Cordeau J., Laporte G., Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. (2001) 52(8):928–936Crossref, Google Scholar
• Cortés C., Matamala M., Contardo C. The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. Eur. J. Oper. Res. (2010) 200(3):711–724Crossref, Google Scholar
• Crainic T., Kim K., Barnhart C., Laporte G. Intermodal transportation. Transportation, Vol. 14 of Handbooks in Operations Research and Management Science (2007) (Elsevier, Amsterdam) 467–537Google Scholar
• Crainic T., Ricciardi N., Storchi G. Models for evaluating and planning city logistics systems. Transportation Sci. (2009) 43(4):432–454Link, Google Scholar
• Crainic T., Mancini S., Perboli G., Tadei R. Multi-start heuristics for the two-echelon vehicle routing problem. (2010) . Technical Report CIRRELT-2010-30, Centre interuniversitaire de recherche sur les réseaux d'entreprise, la logistique et le transport, MontréalGoogle Scholar
• De Rosa B., Improta G., Ghiani G., Musmanno R. The arc routing and scheduling problem with transshipment. Transportation Sci. (2002) 36(3):301–313Link, Google Scholar
• Del Pia A., Filippi C. A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. Internat. Trans. Oper. Res. (2006) 13(2):125–141Crossref, Google Scholar
• Derigs U., Döhmer T. Indirect search for the vehicle routing problem with pickup and delivery and time windows. OR Spectrum (2008) 30(1):149–165Crossref, Google Scholar
• Derigs U., Li B., Vogel U. Local search-based metaheuristics for the split delivery vehicle routing problem. J. Oper. Res. Soc. (2010) 61(9):1356–1364Crossref, Google Scholar
• Desaulniers G. Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper. Res. (2010) 58(1):179–192Link, Google Scholar
• Desaulniers G., Hickman M., Barnhart C., Laporte G. Public transit. Transportation, Vol. 14 of Handbooks in Operations Research and Management Science (2007) (Elsevier, Amsterdam) 69–127Google Scholar
• Desaulniers G., Desrosiers J., Solomon M.Column Generation (2005) (Springer, New York) Crossref, Google Scholar
• Desaulniers G., Desrosiers J., Ioachim I., Solomon M., Soumis F., Villeneuve D., Crainic T., Laporte G. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. Fleet Management and Logistics (1998) (Kluwer, Boston) 57–93Crossref, Google Scholar
• Dohn A., Kolind E., Clausen J. The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach. Comput. Oper. Res. (2009) 36(4):1145–1157Crossref, Google Scholar
• Drexl M. On some generalized routing problems. (2007) . Ph.D. thesis, Faculty of Business and Economics, RWTH Aachen University, Aachen, GermanyGoogle Scholar
• Drexl M. Synchronization in vehicle routing—A survey of VRPs with multiple synchronization constraints. (2011) . Technical report 1103, Gutenberg School of Management and Economics, Johannes Gutenberg University, Mainz, GermanyGoogle Scholar
• Ebben M., van der Heijden M., van Harten A. Dynamic transport scheduling under multiple resource constraints. Eur. J. Oper. Res. (2005) 167(2):320–335Crossref, Google Scholar
• El Hachemi N., Gendreau M., Rousseau L.-M. A heuristic to solve the synchronized log-truck scheduling problem. Comput. Oper. Res. (2011a) . ForthcomingGoogle Scholar
• El Hachemi N., Gendreau M., Rousseau L.-M. A hybrid constraint programming approach to the log-truck scheduling problem. Ann. Oper. Res. (2011b) 184(1):163–178Crossref, Google Scholar
• Feige D. Kapazitiertes Nonbipartites Matching als Optimierungskern eines Planungsverfahrens für Logistikdienstleister in der Transportwirtschaft. (2003) . Technical report 2/2003, Diskussionsbeiträge zu Wirtschaftsinformatik und Operations Research, Wirtschaftswissenschaftliche Fakultät, Martin-Luther-Universität Halle-WittenbergGoogle Scholar
• Freling R., Huisman D., Wagelmans A. Models and algorithms for integration of vehicle and crew scheduling. J. Scheduling (2003) 6(1):63–85Crossref, Google Scholar
• Fügenschuh A. The vehicle routing problem with coupled time windows. Central Eur. J. Oper. Res. (2006) 14(2):157–176Crossref, Google Scholar
• Fügenschuh A. Solving a school bus scheduling problem with integer programming. Eur. J. Oper. Res. (2009) 193(3):867–884Crossref, Google Scholar
• Funke B., Grünert T., Irnich S. Local search for vehicle routing and scheduling problems: Review and conceptual integration. J. Heuristics (2005) 11(4):267–306Crossref, Google Scholar
• Gélinas S., Desrochers M., Desrosiers J., Solomon M. A new branching strategy for time constrained routing problems with application to backhauling. Ann. Oper. Res. (1995) 61(1):91–109Crossref, Google Scholar
• Gendreau M., Potvin J.-Y.Handbook of Metaheuristics (2010) 2nd ed.(Springer, New York) Crossref, Google Scholar
• Gendreau M., Laporte G., Séguin R. Stochastic vehicle routing. Eur. J. Oper. Res. (1996) 88(1):3–12Crossref, Google Scholar
• Gerdessen J. Vehicle routing problem with trailers. Eur. J. Oper. Res. (1996) 93(1):135–147Crossref, Google Scholar
• Ghiani G., Improta G., Laporte G. The capacitated arc routing problem with intermediate facilities. Networks (2001) 37(3):134–143Crossref, Google Scholar
• Golden B., Raghavan S., Wasil E.The Vehicle Routing Problem: Latest Advances and New Challenges, Vol. 43 of Operations Research/Computer Science Interfaces Series (2008) (Springer, Berlin) Crossref, Google Scholar
• Gonzalez-Feliu J. The multi-echelon location-routing problem: Concepts and methods for tactical and operational planning. (2009) . Technical report, Laboratoire d'Economie des Transports, Institut des Sciences de l'Homme, Lyon, FranceGoogle Scholar
• Gonzalez-Feliu J., Perboli G., Tadei R., Vigo D. The two-echelon capacitated vehicle routing problem. (2008) . Technical report, Control and Computer Engineering Department, Politecnico di Torino, ItalyGoogle Scholar
• Gørtz I., Nagarajan V., Ravi R., Fiat A., Sanders P. Minimum makespan multi-vehicle dial-a-ride. Algorithms—ESA 2009, Vol. 5757 of Lecture Notes in Computer Science (2009) (Springer, Berlin) 540–552Google Scholar
• Groër B., Golden B., Wasil E. The consistent vehicle routing problem. Manufacturing Service Oper. Management (2009) 11(4):630–643Link, Google Scholar
• Grünert T., Sebastian H. Planning models for long-haul operations of postal and express shipment companies. Eur. J. Oper. Res. (2000) 122(2):289–309Crossref, Google Scholar
• Hempsch C., Irnich S., Golden B., Raghavan S., Wasil E. Vehicle routing problems with inter-tour resource constraints. The Vehicle Routing Problem: Latest Advances and New Challenges (2008) (Springer, New York) 421–444Crossref, Google Scholar
• Hennig F. Optimization in maritime transportation: Crude oil tanker routing and scheduling. (2010) . Ph.D. thesis, Department of Industrial Economics and Technology Management, Norwegian University of Science and Technology, Trondheim, NorwayGoogle Scholar
• Hertz A., Mittaz M. A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transportation Sci. (2001) 35(4):425–434Link, Google Scholar
• Hollis B., Forbes M., Douglas B. Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post. Eur. J. Oper. Res. (2006) 173(1):133–150Crossref, Google Scholar
• Hooker J., Natraj N. Solving a general routing and scheduling problem by chain decomposition and tabu search. Transportation Sci. (1995) 29(1):30–44Link, Google Scholar
• Imai A., Nishimura E., Current J. A Lagrangian relaxation-based heuristic for the vehicle routing with full container load. Eur. J. Oper. Res. (2007) 176(1):87–105Crossref, Google Scholar
• Ioachim I., Desrosiers J., Soumis F., Bélanger N. Fleet assignment and routing with schedule synchronization constraints. Eur. J. Oper. Res. (1999) 119(1):75–90Crossref, Google Scholar
• Ioachim I., Gélinas S., Soumis F., Desrosiers J. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks (1998) 31(3):193–204Crossref, Google Scholar
• Irnich S. A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS J. Comput. (2008) 20(2):270–287Link, Google Scholar
• Irnich S., Desaulniers G., Desaulniers G., Desrosiers J., Solomon M. Shortest path problems with resource constraints. Column Generation (2005) (Springer, New York) 33–65Crossref, Google Scholar
• Jacobsen S., Madsen O. A comparative study of heuristics for a two-level routing-location problem. Eur. J. Oper. Res. (1980) 5(6):378–387Crossref, Google Scholar
• Jepsen M., Petersen B., Spoorendonk S. A branch-and-cut algorithm for the elementary shortest path problem with a capacity constraint. (2008) . Technical report 08/01, Department of Computer Science, University of CopenhagenGoogle Scholar
• Jones E., Dias M., Stentz A. Time-extended multi-robot coordination for domains with intra-path constraints. Autonomous Robots (2010) Google Scholar
• Kim B., Koo J., Park J. The combined manpower-vehicle routing problem for multi-staged services. Expert Systems Appl. (2010) 37(12):8424–8431Crossref, Google Scholar
• Klabjan D., Desaulniers G., Desrosiers J., Solomon M. Large-scale models in the airline industry. Column Generation (2005) (Springer, New York) 163–195Crossref, Google Scholar
• Laurent B., Hao J. Simultaneous vehicle and driver scheduling: A case study in a limousine rental company. Comput. Indust. Engineering (2007) 53(3):542–558Crossref, Google Scholar
• Li Y., Lim A., Rodrigues B. Manpower allocation with time windows and job-teaming constraints. Naval Res. Logist. (2005) 52(4):302–311Crossref, Google Scholar
• Lim A., Rodrigues B., Song L. Manpower allocation with time windows. J. Oper. Res. Soc. (2004) 55(11):1178–1186Crossref, Google Scholar
• Lin C. A cooperative strategy for a vehicle routing problem with pickup and delivery time windows. Comput. Indust. Engrg. (2008) 55(4):766–782Crossref, Google Scholar
• Lübbecke M., Desrosiers J. Selected topics in column generation. Oper. Res. (2005) 53(6):1007–1023Link, Google Scholar
• Macharis C., Bontekoning Y. Opportunities for OR in intermodal freight transport research: A review. Eur. J. Oper. Res. (2004) 153(2):400–416Crossref, Google Scholar
• Mitrović-Minić S., Laporte G. The pickup and delivery problem with time windows and transshipment. INFOR (2006) 44(3):217–227Google Scholar
• Moin N., Salhi S. Inventory routing problems: A logistical overview. J. Oper. Res. Soc. (2007) 58(9):1185–1194Crossref, Google Scholar
• Mues C., Pickl S. Transshipment and time windows in vehicle routing. Proc. 8th Internat. Sympos. Parallel Architectures, Algorithms and Networks (2005) Piscataway, NJ:113–119Google Scholar
• Nagy G., Salhi S. Location-routing: Issues, models and methods. Eur. J. Oper. Res. (2007) 177(2):649–672Crossref, Google Scholar
• Nguyen V., Prins C., Prodhon C., Blesa M., Blum C., Raidl G., Roli A., Samples M. A multi-start evolutionary local search for the two-echelon location routing problem. Hybrid Metaheuristics, Vol. 6373 of Lecture Notes in Computer Science (2010) (Springer, Berlin) 88–102Google Scholar
• Nowak M., Ö Ergun, White C. Pickup and delivery with split loads. Transportation Sci. (2008) 42(1):32–43Link, Google Scholar
• Oertel P. Routing with reloads. (2000) . Ph.D. thesis, Faculty of Mathematics and Natural Sciences, University of Cologne, GermanyGoogle Scholar
• Oppen J., Løkketangen A., Desrosiers J. Solving a rich vehicle routing and inventory problem using column generation. Comput. Oper. Res. (2010) 37(7):1308–1317Crossref, Google Scholar
• Park J., Kim B. The school bus routing problem: A review. Eur. J. Oper. Res. (2010) 202(2):311–319Crossref, Google Scholar
• Perboli G., Tadei R., Vigo D. The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. (2008) . Technical report CIRRELT-2008-55, Centre interuniversitaire de recherche sur les réseaux d'entreprise, la logistique et le transport, MontréalGoogle Scholar
• Perboli G., Tadei R., Masoero F. Valid inequalities for the two-echelon capacitated vehicle routing problem. (2009) . Technical report CIRRELT-2009-39, Centre interuniversitaire de recherche sur les réseaux d'entreprise, la logistique et le transport, MontréalGoogle Scholar
• Perboli G., Tadei R., Masoero F. New families of valid inequalities for the two-echelon vehicle routing problem. Electronic Notes in Discrete Math. (2010) 36:639–646Crossref, Google Scholar
• Prescott-Gagnon E., Desaulniers G., Rousseau L.-M. Heuristics for an oil delivery vehicle routing problem. (2010) . Technical report G-2010-63, Les Cahiers du GERAD, MontréalGoogle Scholar
• Recker W. The household activity pattern problem: General formulation and solution. Transportation Res. Part B (1995) 29(1):61–77Crossref, Google Scholar
• Rivers C. Coordination in vehicle routing. (2002) . Ph.D. thesis, Massey University, Palmerston North, New ZealandGoogle Scholar
• Røpke S.Heuristic and Exact Algorithms for Vehicle Routing Problems (2005) . Ph.D. thesis, Department of Computer Science, University of CopenhagenGoogle Scholar
• Rousseau L.-M., Gendreau M., Pesant M. The synchronized vehicle dispatching problem. (2003) Odysseus 2003, Second International Workshop on Freight Transportation and LogisticsPalermo, ItalyGoogle Scholar
• Russell R., Morrel R. Routing special-education school buses. Interfaces (1986) 16(5):56–64Link, Google Scholar
• Scheuerer S. A tabu search heuristic for the truck and trailer routing problem. Comput. Oper. Res. (2006) 33(4):894–909Crossref, Google Scholar
• Schmid V., Doerner K., Hartl R., Salazar-González J. Hybridization of very large neighborhood search for ready-mixed concrete delivery problems. Comput. Oper. Res. (2010) 37(3):559–574Crossref, Google Scholar
• Schönberger J., Kopfer H., Wenning B., Rekersbrink H., Fleischmann B., Borgwardt K., Klein R., Tuma A. Vehicle and commodity flow synchronization. Operations Research Proceedings 2008 (2009) (Springer, Berlin) 307–312Crossref, Google Scholar
• Semet F., Taillard E. Solving real-life vehicle routing problems efficiently using tabu search. Ann. Oper. Res. (1993) 41(4):469–488Crossref, Google Scholar
• Shang J., Cuff C. Multicriteria pickup and delivery problem with transfer opportunity. Comput. Indust. Engrg. (1996) 30(4):631–645Crossref, Google Scholar
• Shima T., Rasmussen S., Sparks A., Passino K. Multiple task assignments for cooperating uninhabited aerial vehicles using genetic algorithms. Comput. Oper. Res. (2006) 33(11):3252–3269Crossref, Google Scholar
• Tarantilis C., Zachariadis E., Kiranoudis C. A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities. INFORMS J. Comput. (2008) 20(1):154–168Link, Google Scholar
• Thangiah S., Fergany A., Awan S. Real-time split-delivery pickup and delivery time window problems with transfers. Central Eur. J. Oper. Res. (2007) 15(4):329–349Crossref, Google Scholar
• Toth P., Vigo D.The Vehicle Routing Problem (2002) (Philadelphia)SIAM Monographs on Discrete Mathematics and ApplicationsCrossref, Google Scholar
• Wen M., Larsen J., Clausen J., Cordeau J., Laporte G. Vehicle routing with cross-docking. J. Oper. Res. Soc. (2009) 60(12):1708–1718Crossref, Google Scholar
• Wieberneit N. Service network design for freight transportation: A review. OR Spectrum (2008) 30(1):77–112Crossref, Google Scholar
• Xiang Z., Chu C., Chen H. A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. Eur. J. Oper. Res. (2006) 174(2):1117–1139Crossref, Google Scholar
• Zäpfel G., Bögl M. Multi-period vehicle routing and crew scheduling with outsourcing options. Internat. J. Production Econom. (2008) 113(2):980–996Crossref, Google Scholar