Orienteering Problems (OPs) are used to model many routing and trip planning problems. OPs are a variant of the well-known traveling salesman problem where the goal is to compute the highest reward path that includes a subset of vertices and …
© 2017 Elsevier LtdThis paper addresses a real-life delivery problem often encountered by urban perishable product deliverers, in which the providers suffer losses from failed delivery, such as product deterioration or violating customers’ time windows, especially when delivery orders accepted …
© 2017 Elsevier LtdThe consideration of pollution in routing decisions gives rise to a new routing framework where measures of the environmental implications are traded off with business performance measures. To address this type of routing decisions, we formulate and …
The time-dependent pollution-routing problem of free pickup and delivery of passengers to the airport service (TDFPDS) is an extension of the time-dependent pollution-routing problems, arising in flight ticket sales companies for the service of free pickup and delivery of airline …
© 2014In this paper, we consider the time-dependent multi-depot vehicle routing problem. The objective is to minimize the total heterogeneous fleet cost assuming that the travel time between locations depends on the departure time. Also, hard time window constraints for …
© 2015 Elsevier B.V. All rights reserved.This paper focuses on the problem of minimizing CO2 emissions in the routing of vehicles in urban areas. While many authors have realized the importance of speed in minimizing emissions, most of the existing …
© 2015 Elsevier Ltd.The time-dependent prize-collecting arc routing problem (TD-PARP) determines a number of full truckload orders and plans a vehicle route to maximize profit, which is calculated as total collected revenue (prizes) minus total travel cost. The travel cost …
© 2014 Elsevier Ltd.A heuristic algorithm, called LANCOST, is introduced for vehicle routing and scheduling problems to minimize the total travel cost, where the total travel cost includes fuel cost, driver cost and congestion charge. The fuel cost required is …
© 2014 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.The classic vehicle routing problems are usually designed with one edge (or arc) between two nodes. However, sometimes, there are situations in which one node can be …
© 2015 Wiley Periodicals, Inc.Timing problems involve the choice of task execution dates within a predetermined processing sequence, and under various additional constraints or objectives such as time windows, time-dependent costs, or flexible processing times, among others. Their efficient resolution …