The deterministic Traveling Purchaser Problem looks for a tour visiting a subset of markets in order to satisfy a positive discrete demand for some products at minimum traveling and purchasing costs. In this paper, we assume that the quantities available …
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 …
© 2017 Growing Science Ltd. All rights reserved.This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle …
Conventionally, vehicle routing problems are defined on a network in which the customer locations and arcs are given. Typically, these arcs somehow represent the distances or expected travel time derived from the underlying road network. When executed, the quality of …
This paper introduces the stochastic time-dependent orienteering problem with time windows. The orienteering problem occurs in logistic situations where an optimal combination of locations must first be selected and then the routing between these selected locations must be optimized. In …
© 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 …
We propose a new speed and departure time optimization algorithm for the pollution-routing problem (PRP), which runs in quadratic time and returns an optimal schedule. This algorithm is embedded into an iterated local search-based metaheuristic to achieve a combined speed, …
© 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 …
Time-dependent routing amounts to design “best” routes in a graph in which arc traversal times may vary over the planning horizon. In the last decade, a number of technological advances have stimulated an increased interest in this field. We survey …