An interactive computerized algorithm for multicriteria vehicle routing problems

Multi-objective vehicle routing problems

“…Other objectives related to the node/arc activity both assign a priority to the nodes or the arcs and create a dependence between the nodes and/or the arcs [54,55]. It is also possible to define economic or marketing objectives, such as increasing customer satisfaction [61] or improving the customer-driver relationship [58].…”

“…However, other motivations are possible. For instance, in studies by Park and Koelling [54,55], the distance traveled must be minimized to avoid damaging the product being transported.…”

“…For instance, the latter can be used to consider the fact that the merchandise is perishable in order to avoid its deterioration [54,55].…”

A dial-a-ride problem for client transportation in a health-care organization

“…Constraint (13) ensures that a vehicle starts its route empty. Constraint (14) guarantees the binary integrality of variables X ijk while constraints (15) and (16) guarantee the nonnegativity of all other variables. Integrality constraint for variables L ik is not required; constraints (12) and (13) force variables L ik to take integer values only.…”

“…Until recently, most of the existing vehicle routing and scheduling literature focused solely on the minimization of travel distances, travel time or transportation cost. Similar to [13][14][15]9] we considered the multiple objective nature of the problem by compromising the conflicting goals of minimizing transportation cost and customer inconvenience time. 2.…”