Moon, Ilkyeong, Salhi, Said, Feng, Xuehao (2020) The location-routing problem with multi-compartment and multi-trip: formulation and heuristic approaches. Transportmetrica A: Transport Science, 16 (3). pp. 501-528. ISSN 2324-9935. (doi:10.1080/23249935.2020.1720036) (KAR id:80010)
PDF
Author's Accepted Manuscript
Language: English |
|
Download this file (PDF/1MB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: https://doi.org/10.1080/23249935.2020.1720036 |
Abstract
The location-routing problem with multi-compartment and multi-trip is an extension to the standard location-routing problem. In this problem, depots are used to deliver different products using heterogeneous vehicles with several compartments. Each compartment has a limited capacity and is dedicated to a single type of product. The problem is formulated as a mixed integer program. A constructive heuristic and a hybrid genetic algorithm (HGA) are proposed. Numerical experiments show that both heuristics can efficiently determine the optimal solutions on small size instances. For larger ones, the HGA outperforms the constructive heuristic with relatively more computational time. Managerial insights have been obtained from sensitivity analyses which would be helpful to improve the performance of the supply network.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1080/23249935.2020.1720036 |
Uncontrolled keywords: | Location-routing problem, multi-compartment, multi-trip, mixed integer program, heuristic |
Subjects: | H Social Sciences > HF Commerce |
Divisions: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
Depositing User: | Said Salhi |
Date Deposited: | 10 Feb 2020 12:09 UTC |
Last Modified: | 05 Nov 2024 12:45 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/80010 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):