An algorithm for solving capacitated multicommodity p-median transportation problems

An algorithm for solving capacitated multicommodity p-median transportation problems

0.00 Avg rating0 Votes
Article ID: iaor19932425
Country: United Kingdom
Volume: 44
Issue: 3
Start Page Number: 259
End Page Number: 269
Publication Date: Mar 1993
Journal: Journal of the Operational Research Society
Authors: ,
Abstract:

An algorithm for solving a special capacitated multicommodity p-median transportation problem (CMPMTP), which arises in container terminal management, is presented. There are some algorithms to solve similar kinds of problems. The formulation here is different from the existing modelling of the p-median or some related location problems. The authors extend the existing work by applying a Lagrangean relaxation to the CMPMTP. In order to obtain a satisfactory solution, a heuristic branch-and-bound algorithm is designed to search for a better solution, if one is possible. A comparison is also made with different algorithms.

Reviews

Required fields are marked *. Your email address will not be published.