Vehicle routing with full loads
From MaRDI portal
DOI10.1016/0305-0548(88)90034-2zbMATH Open0637.90055OpenAlexW1967052903MaRDI QIDQ1099072FDOQ1099072
Authors: Jacques Desrosiers, G. Laporte, Michel Sauvé, 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
Recommendations
Cites Work
- Some Simple Applications of the Travelling Salesman Problem
- 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
- Vehicle routing via column generation
Cited In (12)
- Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
- Routing problems with loading constraints
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
- Routing a vehicle of capacity greater than one
- Un algorithme de minimisation du transport à vide appliqué à l'industrie forestière
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- The vehicle allocation problem: alternative formulation and branch-and-price method
- Multiperiod integrated routing and scheduling of World Food Programme cargo planes in Angola
- Routing heuristics for automated pick and place machines
- Routing problems: A bibliography
- New savings based algorithms for time constrained pickup and delivery of full truckloads.
- Mixed-integer linear optimization for full truckload pickup and delivery
This page was built for publication: Vehicle routing with full loads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099072)