Comparing different metaheuristic approaches for the median path problem with bounded length

Isabella Lari, Federica Ricca and Andrea Scozzari

European Journal of Operational Research, 2008, vol. 190, issue 3, 587-597

Abstract: In this paper we consider the Bounded Length Median Path Problem which can be defined as the problem of locating a path-shaped facility that departures from a given origin and arrives at a given destination in a network. The length of the path is assumed to be bounded by a given maximum length. At each vertex of the network (customer-point) the demand for the service is given and the cost to reach the closest service-point is computed. The objective is to minimize the sum of these costs over all the customer-points in the network. We consider two local search metaheuristics, the well known Tabu search and the Old bachelor acceptance and we propose a comparative analysis of the performances of the two procedures. We implement streamlined versions of Tabu search and Old bachelor acceptance. Our main concern is to provide knowledge about the intrinsic strategy adopted by each metaheuristic and to know whether one is more appropriate than the other for our problem.

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00640-6
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:190:y:2008:i:3:p:587-597

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
Bibliographic data for series maintained by Catherine Liu ().