 Classification, models and exact algorithms for multi-compartment delivery problemsLeandro C. Coelho and Gilbert Laporte European Journal of Operational Research, 2015, vol. 242, issue 3, 854-864 Abstract: The distribution of products using compartmentalized vehicles involves many decisions such as the allocation of products to vehicle compartments, vehicle routing and inventory control. These decisions often span several periods, yielding a difficult optimization problem. In this paper we define and compare four main categories of the Multi-Compartment Delivery Problem (MCDP). We propose two mixed-integer linear programming formulations for each case, as well as specialized models for particular versions of the problem. Known and new valid inequalities are introduced in all models. We then describe a branch-and-cut algorithm applicable to all variants of the MCDP. We have performed extensive computational experiments on single-period and multi-period cases of the problem. The largest instances that could be solved exactly for these two cases contain 50 and 20 customers, respectively. Keywords: Multi-compartment delivery; Vehicle-routing; Inventory-routing; Multi-products; Multi-vehicles (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:242:y:2015:i:3:p:854-864 DOI: 10.1016/j.ejor.2014.10.059 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.