Abstract
Convoy movement problem (CMP) is an important optimisation problem, especially occurring in military logistics, which focuses on routing convoys concurrently in a network. The CMP is subject to constraints for preventing certain interactions between convoys such that the objectives related to travel times of them are minimised. We propose a Lagrangian relaxation (LR) approach to efficiently obtain a lower bound on the optimal solution. Our LR approach does not have integrality property, and hence the lower bound obtained is always tigher than the lower bound obtained using the LP relaxation. As CMP is an NP-complete problem, lower bounds are useful to evaluate the solutions obtained by a heuristic. From our computational experimentation, it is found that the proposed LR approach is superior to the existing LR approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Services and Operations Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
