Designing vehicle routes for a mix of different request types, under time windows and loading constraints
From MaRDI portal
Publication:2355860
DOI10.1016/j.ejor.2013.02.056zbMath1317.90060WikidataQ58646211 ScholiaQ58646211MaRDI QIDQ2355860
Christos D. Tarantilis, Emmanouil E. Zachariadis, Chris T. Kiranoudis
Publication date: 28 July 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.02.056
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90B10: Deterministic network models in operations research
90B80: Discrete location and assignment
Related Items
A nonlinear optimization model for the balanced vehicle routing problem with loading constraints, Tabu search for the real-world carpooling problem, A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints, Buy online and pick up in-store: design of the service area, Vehicle routing problems with loading constraints: state-of-the-art and future directions, The pickup and delivery problem with time windows, multiple stacks, and handling operations
Uses Software
Cites Work
- Integrated distribution and loading planning via a compact metaheuristic algorithm
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- Routing problems with loading constraints
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- An integrated approach to the vehicle routing and container loading problems
- Special issue on: Rich vehicle routing problems
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Probability distribution of solution time in GRASP: an experimental investigation
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- TTT plots: a perl program to create time-to-target plots
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- A Parallel Algorithm for the Vehicle Routing Problem
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
- The General Pickup and Delivery Problem
- Metaheuristics for the vehicle routing problem with loading constraints
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
