Integer and combinatorial optimization
Integer and combinatorial optimization
Structured partitioning problems
Operations Research
An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
Computers and Operations Research
A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
Computers and Operations Research
Discrete Optimization Algorithms with Pascal Programs
Discrete Optimization Algorithms with Pascal Programs
Heuristic solutions to multi-depot location-routing problems
Computers and Operations Research
Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
Operations Research
Multimodal Express Package Delivery: a Service Network Design Application
Transportation Science
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
Operations Research Letters
Leveraging saving-based algorithms by master-slave genetic algorithms
Engineering Applications of Artificial Intelligence
Analysis of neighborhood generation and move selection strategies on the performance of tabu search
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
| Hi-index | 0.98 |
At the core of many delivery-logistics problems is the multiple depot, multiple traveling salesmen facility-location problem (MDMTSFLP). This paper addresses a mixed integer MDMTSFLP formulation, expanded to include vehicle range and multiple service-frequency requirements. Here, vehicle range can be interpreted as limitation on tour length, often due to crew duty day restriction. Once defined, we use this optimization formulation to validate a heuristic solution for location and routing. Our heuristic employs a combination of the minimum spanning forest (MSF) and a modified Clarke-Wright (CW) procedure. The spanning forest is used for geographic partitioning and for depot location, while the CW routes the multiple aircraft fleets. Generalizing from a minimum K-tree, the MSF is an exact O(|I|^3) method for partitioning the demands into service regions and in locating regional depots, where |I| is the number of nodes. The Defense Courier Service (DCS) aerial network provides a huge instance of the hierarchical multiple-frequency, range-restricted MDMTSFLP. For this network, we find our MSF/CW procedure to be suboptimal by 3.86 percent on average over 16 validation runs, with no run worse than 20.27 percent. We show that several depots of the DCS may be closed without a large increase of routing cost. The model and solution procedure presented here have implications upon many other logistics problems, which are typically characterized by multiple vehicular visits and shortage of crew duty days.