Please use this identifier to cite or link to this item:
|Title:||A pickup and delivery selection problem with compulsory requests in an activity-based transportation framework||Authors:||MAES, Tabitha
|Issue Date:||2013||Source:||EURO2013 - 26th European Conference on Operational Research, Rome, Italy, 1-4 july 2013||Abstract:||In an activity-based transportation framework the decisions of agents are simulated to predict future freight flows. One of these agents is the carrier who daily receives multiple transport requests. In order to optimize his profit he has the liberty to refuse transport requests which are not profitable. However, a number of clients cannot be refused because of long-term contracts. The received transport requests consist of paired pickup and delivery locations and orders are less-than-truckload. A tabu-embedded simulated annealing algorithm is developed to solve the problem.||Document URI:||http://hdl.handle.net/1942/15444||Link to publication:||http://www.euro-online.org/conf/admin/tmp/program-euro26.pdf||Category:||C2||Type:||Conference Material|
|Appears in Collections:||Research publications|
Show full item record
checked on May 26, 2022
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.