A nonlinear model for location-allocation-routing problem in transportation network with intelligent travel times
Saber Shiripour,
Nezam Mahdavi-Amiri and
Iraj Mahdavi
International Journal of Operational Research, 2017, vol. 29, issue 3, 400-431
Abstract:
We provide a mixed-integer nonlinear programming (MINLP) model for a location-allocation-routing problem in a transportation network with links carrying the travel times among the nodes in the network. The travel time between two nodes is considered to be intelligent, that is, since the travelling population in a link can affect the travel time, here we consider the impact of the travelling population on the travel time of the link. This way, depending on how the population is distributed in the network, the travel times of the links may change. The problem is to find an optimal locations of server node(s), allocation of existing demand nodes in the network to the server(s) and allocation of the existing population in each node to different routes with respect to simultaneous change of travel times so that total transportation time is minimised. For large problems, we present a genetic algorithm.
Keywords: location-allocation-routing problem; intelligent travel times; mixed-integer nonlinear programming; genetic algorithm; transportation network. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://www.inderscience.com/link.php?id=84343 (text/html)
Access to full text is restricted to subscribers.
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:ids:ijores:v:29:y:2017:i:3:p:400-431
Access Statistics for this article
More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().