| Article ID: | iaor20172316 |
| Volume: | 29 |
| Issue: | 3 |
| Start Page Number: | 400 |
| End Page Number: | 431 |
| Publication Date: | Jun 2017 |
| Journal: | International Journal of Operational Research |
| Authors: | Mahdavi Iraj, MahdaviAmiri Nezam, Shiripour Saber |
| Keywords: | combinatorial optimization, location, vehicle routing & scheduling, allocation: resources, programming: integer, programming: nonlinear, simulation, programming: multiple criteria, heuristics: genetic algorithms, heuristics |
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.