A Two-Level solution approach to solve the Clustered Capacitated Vehicle Routing Problem

Expósito‐Izquierdo, Christopher; Rossi, André; Sevaux, Marc

doi:10.1016/j.cie.2015.11.022

Cited by 60 publications

(48 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The current paper contributes to the existing literature in the following ways. First, we are able to report improved results on most of the instances provided by Expósito-Izquierdo et al (2016) . Secondly, even though good algorithms exist for solving the Clu-VRP , most notably the ones proposed by Vidal et al (2015) , a gap remains for an approach that allows to calculate good solutions in a short amount of computing time .…”

Section: Research Context and Literature Reviewmentioning

confidence: 89%

A fast two-level variable neighborhood search for the clustered vehicle routing problem

Defryn¹,

Srensen²

2017

Computers & Operations Research

View full text Add to dashboard Cite

People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

show abstract

Section: Research Context and Literature Reviewmentioning

confidence: 89%

A fast two-level variable neighborhood search for the clustered vehicle routing problem

Defryn¹,

Srensen²

2017

Computers & Operations Research

View full text Add to dashboard Cite

show abstract

“…The SA algorithm includes many neighbourhood structures for increasing the performance on solving OVRPCD. The clustered CVRP is studied in [9]. To solve the clustered CVRP, a two-level solution approach is presented to gain high quality solutions.…”

Section: Introductionmentioning

confidence: 99%

An optimization algorithm for a capacitated vehicle routing problem with time windows

Kirci

2016

Sādhanā

View full text Add to dashboard Cite

In this paper, vehicle routing problem (VRP) with time windows and real world constraints are considered as a real-world application on google maps. Also, tabu search is used and Hopfield neural networks is utilized. Basic constraints consist of customer demands, time windows, vehicle speed, vehicle capacity and working hours. Recently, cost and on-time delivery are the most important factors in logistics. Thus, the logistic applications attract attention of companies. In logistic management, determining the locations of delivery points and deciding the path are the vital components that should be considered. Deciding the paths of vehicles provides companies to use their vehicles efficiently. And with utilizing optimized paths, big amounts of cost and time savings will be gained. The main aim of the work is providing the best path according to the needs of the customers, minimizing the costs with utilizing the VRP and presenting an application for companies that need logistic management. To compare the results, simulated annealing is used on special scenarios. And t-test is performed in the study for the visited path in km with p-value of 0.05.

show abstract

“…Constraint (9) ensures that only one center appears in each route. Constraint (10) ensures that there is an edge from node i to center j whenever the center j is on route k. Constraint (11) ensures that each route contains no more than one center. Constraint (12) means that there will be no cycle with 2, .…”

Section: Model Developmentmentioning

confidence: 99%

“…Two variations of this problem were proposed and solved with their heuristic after clustering. The work by Expósito-Izquierdo et al [11], in the year 2016, proposed a two-Level solution approach to finding the clusters with minimum total travel cost of the routes that fulfill the demands.…”

Section: Introductionmentioning

confidence: 99%

Clusters with Minimum Transportation Cost to Centers: A Case Study in Corn Production Management

Phonin

Likasiri

Dankrakul

2017

Games

View full text Add to dashboard Cite

Abstract:In Northern Thailand, the size and topographical structure of farmland makes it necessary for operators of small-scale waste management systems to be able to reach their clients in an effective manner. Over the past decades, corn contract farming has increased, and the chief method for eliminating waste from these farms has chiefly been open burning on the fields, which produces enormous amounts of greenhouse gases (GHG) and Polycyclic Aromatic Hydrocarbons (PAHs). To find a way to reduce GHG emissions in the corn production system, this work focuses on finding clusters with minimum transportation time from waste disposal centers. To solve the clustering problems, four models are created and solved on AIMMS and MATLAB. Simulation results indicate that the number of clients essentially affects the performance of the procedure. The case studies are on corn production management in Chiang Mai, the region's economic capital, as well as in 9 provinces in Northern Thailand, including Chiang Mai, whose combined corn production comprises 32.73 percent of the national production. With roughly 15% of the corn cobs and husks involved in the study, we found that by changing the waste elimination process, the total CO 2 emissions can be reduced by up to 12,008.40 tons per year in Chiang Mai and up to 180,198.14 tons per year in the 9 provinces of Northern Thailand.

show abstract

A Two-Level solution approach to solve the Clustered Capacitated Vehicle Routing Problem

Cited by 60 publications

References 41 publications

A fast two-level variable neighborhood search for the clustered vehicle routing problem

A fast two-level variable neighborhood search for the clustered vehicle routing problem

An optimization algorithm for a capacitated vehicle routing problem with time windows

Clusters with Minimum Transportation Cost to Centers: A Case Study in Corn Production Management

Contact Info

Product

Resources

About