Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs

Ceschia, Sara; Gaspero, Luca Di; Schaerf, Andrea

doi:10.1007/s10951-010-0213-x

Cited by 35 publications

(13 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tarantilis and Kiranoudis [20] applied HFVRP to real-life problems in construction and dairy sectors. Ceschia et al [21] formulated a model that incorporates heterogeneous fleet, multiple planning horizons, and options for leaving some orders unscheduled. Mancini [22] formalized a real-life problem with heterogeneous fleet and multiple depots.…”

Section: Vehicle Routing Problems (Vrps)mentioning

confidence: 99%

A Model for Sustainable Courier Services: Vehicle Routing with Exclusive Lanes

et al. 2020

View full text Add to dashboard Cite

In Southeast Asian cities, it is common for logistic companies to operate a heterogeneous fleet of delivery vehicles with motorcycles being the preferred vehicle to handle the final phase of delivery. In such scenarios, heterogeneous fleet vehicle routing problem (HFVRP) is generally applied to plan an optimal delivery. However, in many downtown cores of large and rapidly developing Southeast Asian cities, HFVRP is neither viable nor reliable because of road usage restrictions. The purpose of this article is to develop and test a different approach that accurately takes these restrictions into account and provides viable and more sustainable results. Restrictions in this paper refer to situations of urban areas in Vietnam where (i) certain vehicle types are prohibited in specified areas or where narrow alleyways limit the utilization of vehicles that exceed the road capacity and (ii) certain roads are exclusive to certain vehicle types. In networks, limited access and exclusive lanes are represented as links, or arcs, exclusive to one or another. Taking these limitations into consideration, we have developed a unique model, which we have termed Vehicle Routing Problem with Exclusive Links (VRP-EL). The model was validated and tested for its performance on scenarios with varying ratios of exclusive links. Scenarios up to 500 customers were tested on a meta-heuristic algorithm, simulated annealing. VRP-EL produces realistic outcomes. Limiting certain links to be selected according to vehicle types increases overall travel distance. However, this increase outweighs the cost of re-planning and rerouting had they not been constrained initially. The reduction in traveling distance leads to fossil fuel reduction for the overall system. The estimation of reduced carbon emissions through applying the proposed model is presented. Considering the severe traffic congestion and carbon emissions caused by motorcycles in Vietnam, the proposed model leads to a sustainable road environment.

show abstract

Section: Vehicle Routing Problems (Vrps)mentioning

confidence: 99%

A Model for Sustainable Courier Services: Vehicle Routing with Exclusive Lanes

et al. 2020

View full text Add to dashboard Cite

show abstract

“…This heuristic outperformed all previous ones and was particularly effective on large-size instances due to the use of the ejection chain mechanism which allows multiple displacements of customers served by heterogeneous vehicles. Ceschia et al (2011) studied another extension of the FSMTW with Carrier-Dependent Costs. The problem works with a heterogeneous fleet, a multi-day planning horizon, complex carrier-dependent vehicle costs, and the possibility of not serving some orders.…”

Section: The Hvrp With External Carriersmentioning

confidence: 99%

Thirty years of heterogeneous vehicle routing

Koç

Bektaş

Jabali

et al. 2016

European Journal of Operational Research

195

View full text Add to dashboard Cite

It has been around thirty years since the heterogeneous vehicle routing problem was introduced, and significant progress has since been made on this problem and its variants. The aim of this survey paper is to classify and review the literature on heterogeneous vehicle routing problems. The paper also presents a comparative analysis of the metaheuristic algorithms that have been proposed for these problems.

show abstract

“…Studies by Paraskevopoulos et al (2008) and by Ceschia et al (2011) both describe variable neighbourhood tabu search algorithms to solve the HVRPTW, the objectives of which are to minimize total cost. Vehicle routing and scheduling algorithms have been applied to a wide variety of waste collection problems: for example, Kim et al (2006) considered time windows associated with commercial waste collections; Angelelli and Speranza (2002) compared alternative collection methods, with varying types of containers and vehicles used; and Amponsah McLeod, Erdogan, Cherrett, Bektas, Shingleton, Davies, Speed, Dickinson, Norgate 5 and Salhi (2004) focused on waste collection problems faced in developing countries.…”

Section: Background To the Routing Problemmentioning

confidence: 99%

Improving collection efficiency through remote monitoring of charity assets

et al. 2014

View full text Add to dashboard Cite

Collection costs associated with servicing a major UK charity's donation banks and collecting unsold goods from their retail shops can account for up to 20% of the overall income gained. Bank and shop collections are commingled and are typically made on fixed days of the week irrespective of the amounts of materials waiting to be collected. . Using collection records from a major UK charity, this paper considers what vehicle routing and scheduling benefits could accrue if bank and shop servicing requirements were monitored, the former using remote sensing technology to allow more proactive collection scheduling. A vehicle routing and scheduling algorithm employing tabu search methods was developed, and suggested time and distance savings of up to 30% over the current fixed schedules when a minimum bank and shop fill level of between 50% and 60% was used as a collection trigger. For the case study investigated, this led to a potential revenue gain of 5% for the charity and estimated CO 2 savings of around 0.5 tonnes per week across the fleet of six heterogeneous vehicles.

show abstract

Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs

Cited by 35 publications

References 42 publications

A Model for Sustainable Courier Services: Vehicle Routing with Exclusive Lanes

A Model for Sustainable Courier Services: Vehicle Routing with Exclusive Lanes

Thirty years of heterogeneous vehicle routing

Improving collection efficiency through remote monitoring of charity assets

Contact Info

Product

Resources

About