Next Article in Journal
Exact Solutions of Non-Linear Evolution Models in Physics and Biosciences Using the Hyperbolic Tangent Method
Next Article in Special Issue
An Improved Differential Evolution Algorithm for Crop Planning in the Northeastern Region of Thailand
Previous Article in Journal
Qualitative Analysis of a Dengue Fever Model
Previous Article in Special Issue
A Survey of Recent Trends in Multiobjective Optimal Control—Surrogate Models, Feedback Control and Objective Reduction
Article Menu
Issue 3 (September) cover image

Export Article

Open AccessArticle
Math. Comput. Appl. 2018, 23(3), 34; https://doi.org/10.3390/mca23030034

Modified Differential Evolution Algorithm Solving the Special Case of Location Routing Problem

1
Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen 40000, Thailand
2
Faculty of Informatics, Mahasarakham University, Maha Sarakham 44000, Thailand
*
Author to whom correspondence should be addressed.
Received: 18 June 2018 / Revised: 1 July 2018 / Accepted: 1 July 2018 / Published: 3 July 2018
(This article belongs to the Special Issue Numerical and Evolutionary Optimization)
Full-Text   |   PDF [1047 KB, uploaded 5 July 2018]   |  

Abstract

This research article aims to solve the special case of the location routing problem (SLRP) when the objective function is the fuel consumption. The fuel consumption depends on the distance of travel and the condition of the road. The condition of the road causes the vehicle to use a different speed, which affects fuel usage. This turns the original LRP into a more difficult problem. Moreover, the volume of the goods that are produced in each node could be more or less than the capacity of the vehicle, and as the case study requires the transportation of latex, which is a sensitive good and needs to be carried within a reasonable time so that it does not form solid before being used in the latex process, the maximum time that the latex can be in the truck is limited. All of these attributes are added into the LRP and make it a special case of LRP: a so-called SLRP (a special case of location routing problem). The differential evolution algorithms (DE) are proposed to solve the SLRP. We modified two points in the original DE, which are that (1) the mutation formula is introduced and (2) the new rule of a local search is presented. We call this the modified differential evolution algorithm (MDE). From the computational result, we can see that MDE generates a 13.82% better solution than that of the original version of DE in solving the test instances. View Full-Text
Keywords: location routing problem; rubber; modify differential evolution algorithm; vehicle routing problem location routing problem; rubber; modify differential evolution algorithm; vehicle routing problem
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Akararungruangkul, R.; Kaewman, S. Modified Differential Evolution Algorithm Solving the Special Case of Location Routing Problem. Math. Comput. Appl. 2018, 23, 34.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Math. Comput. Appl. EISSN 2297-8747 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top