Computers and Operations Research
A multi-phase constructive heuristic for the vehicle routing problem with multiple trips
Discrete Applied Mathematics - International symposium on combinatorial optimisation
Routing Optimization for Waste Management
Interfaces
Computers and Operations Research
Computers and Operations Research
Vehicle routing and scheduling with dynamic travel times
Computers and Operations Research
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
Computers and Operations Research
A general heuristic for vehicle routing problems
Computers and Operations Research
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
INFORMS Journal on Computing
Decision-Aiding Methodology for the School Bus Routing and Scheduling Problem
Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Transportation Science
Integrating multi-product production and distribution in newspaper logistics
Computers and Operations Research
Improved route planning and scheduling of waste collection and transport
Expert Systems with Applications: An International Journal
The multiple TSP with time windows: vehicle bounds based on precedence graphs
Operations Research Letters
Hi-index | 7.29 |
This paper is the first to discuss the communal home meal delivery problem. The problem can be modelled as a multiple travelling salesman problem with time windows, that is closely related to the well-studied vehicle routing problem with time windows. Experimental results are reported for a real-life case study from Central Finland over several alternative scenarios using the SPIDER commercial solver. The comparison with current practice reveals that a significant savings potential can be obtained using off-the-shelf optimization tools. As such, the potential for supporting real-life communal routing problems can be considered to be important for VRP practitioners.