Comparing different metaheuristic approaches for the median path problem with bounded length |
| |
Authors: | Isabella Lari Federica Ricca Andrea Scozzari |
| |
Institution: | Università di Roma “La Sapienza”, Dip. Statistica, Probabilità e Statistiche Applicate, P.le Aldo Moro 5, 00185 Roma, Italy |
| |
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. |
| |
Keywords: | Location Median path problem Old bachelor acceptance Tabu search |
本文献已被 ScienceDirect 等数据库收录! |