Vehicle routing with full loads

DOI10.1016/0305-0548(88)90034-2zbMath0637.90055OpenAlexW1967052903MaRDI QIDQ1099072

Jacques Desrosiers, Michel Sauvé, Gilbert Laporte, Serge Taillefer, François Soumis

Publication date: 1988

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90034-2

zbMATH Keywords

vehicle routingasymmetrical travelling salesmanfull loadstime limit constraints

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

The vehicle allocation problem: alternative formulation and branch-and-price method, An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization, Multiperiod integrated routing and scheduling of World Food Programme cargo planes in Angola, Routing problems: A bibliography, Un algorithme de minimisation du transport à vide appliqué à l'industrie forestière, A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system, New savings based algorithms for time constrained pickup and delivery of full truckloads., Mixed-integer linear optimization for full truckload pickup and delivery, Routing heuristics for automated pick and place machines, Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters

Cites Work

• Vehicle routing via column generation
• Routing with time windows by column generation
• A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• Some Simple Applications of the Travelling Salesman Problem