A New Multi-Objective Green Location Routing Problem with Heterogonous Fleet of Vehicles and Fuel Constraint

A New Multi-Objective Green Location Routing Problem with Heterogonous Fleet of Vehicles and Fuel Constraint

Masoud Rabbani, Mohsen Davoudkhani, Hamed Farrokhi-Asl
Copyright: © 2017 |Pages: 21
DOI: 10.4018/IJSDS.2017070105
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This paper introduces a new variant of Multi-Objective Green Location Routing Problem (MOGLRP) in which the start and end location of each route can be distinct. In this paper, the authors present a new mathematical formulation for the MOGLRP with consideration of environmentally issues. MOGLRP states for the problem of finding routes for vehicles to serve a set of customers while minimizes the total traveled distance, minimizes the total cost including vehicle fixed cost and variable travel cost and the co2 emissions. In order to solve the proposed model, two solution methods are used. Firstly, an exact method which is able to solve small sized problems is applied. Since the exact methods are not able to solve NP-hard problems in a reasonable time, the second method which is called multi-objective evolutionary algorithms (MOEA) are taken into account to deal with large instances. Furthermore, four well-known multi-objective evolutionary algorithms, including non-dominated sorting genetic algorithm (NSGA-II) and multi-objective particle swarm optimization (MOPSO), Strength Pareto Evolutionary Algorithm II (SPEA- II) and Pareto Envelope-based Selection Algorithm II (PESA-II) are used to compare obtained results. A comparison results show the proficiency of the proposed algorithm with respect to the four performance metrics, including quantity metric, diversification metric, spacing metrics and mean ideal distance. Finally, concluding remarks and future research directions are provided.
Article Preview
Top

2. Literature Review

Vehicle routing problem (VRP) is a typical optimization problem, in which a set of vehicle service a set of customers. Each vehicle that services customers starts the travel from the depot and finishes it in the depot as well. This problem was first defined by Dantzig and Ramser (1959). VRP is a generalization of a Traveling Salesman Problem (TSP), where only one traveler takes into account. The TSP is defined as a set of cities, where a single traveler needs to visit all of them and return to the starting city. The objective of the TSP is to find the shortest route. The objective of the typical VRP is to find the solution, at first, minimizing the total vehicle number required, and secondly, minimizing the length of the total traveled path.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 12: 3 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing