A Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm | Zendy

Mohammad Fallah | Zendy; Reza TavakkoliMoghaddam | Zendy; A. Salamatbakhsh-Varjovi | Zendy; Mahdi Alinaghian | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm

Author(s) -

Mohammad Fallah,

Reza TavakkoliMoghaddam,

A. Salamatbakhsh-Varjovi,

Mahdi Alinaghian

Publication year - 2019

Publication title -

international journal of engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.225

H-Index - 17

ISSN - 1728-1431

DOI - 10.5829/ije.2019.32.07a.10

Subject(s) - vehicle routing problem , fuel efficiency , truck , differential evolution , particle swarm optimization , computer science , mathematical optimization , greenhouse gas , reduction (mathematics) , differential (mechanical device) , distributor , service (business) , routing (electronic design automation) , algorithm , automotive engineering , mathematics , engineering , economics , computer network , ecology , geometry , biology , aerospace engineering , mechanical engineering , economy

Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routing problem (VRP) to optimize sales of distributers, in which the time of distributor service to customers is uncertain. To solve the model precisely, the improved differential evolution (IDE) algorithm is used and obtained results were compared with the result of a particle swarm optimization (PSO) algorithm. The results indicate that the IDE algorithm is able to obtain better solutions in solving large-sized problems; however, the computational time is worse than PSO.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research