期刊名称:Information Technology and Management Science
印刷版ISSN:2255-9086
电子版ISSN:2255-9094
出版年度:2015
卷号:18
期号:1
页码:84-90
DOI:10.1515/itms-2015-0013
语种:English
出版社:Walter de Gruyter GmbH
摘要:Operational planning decisions of a carrier consist of accepting transport requests and constructing vehicle routes. However, a carrier has only a limited capacity within his own vehicle fleet and can only serve a selection of clients. Transport requests are accepted only if they contribute to a higher total profit. This practical aspect is modelled with the Pickup and Delivery with selection of customers. A mixed-integer programming formulation is given. It is indicated how the problem is solved by means of a meta-heuristic, more specifically a tabu-embedded simulated annealing algorithm. A number of alternative settings may appear in practice. They are discussed in this article.
关键词:Heuristic algorithms ; operations research ; optimisation ; vehicle routing