Next Article in Journal
Factors Affecting Purchase Intentions in Generation Y: An Empirical Evidence from Fast Food Industry in Malaysia
Previous Article in Journal
Women’s Role in the Accounting Profession: A Comparative Study between Italy and Romania
Article Menu
Issue 1 (March) cover image

Export Article

Open AccessArticle
Adm. Sci. 2019, 9(1), 3; https://doi.org/10.3390/admsci9010003

Methodology to Solve the Combination of the Generalized Assignment Problem and the Vehicle Routing Problem: A Case Study in Drug and Medical Instrument Sales and Service

1
Department of Marketing, Mahasarakarm Business School, Mahasarakham University, Maha Sarakham 44000, Thailand
2
Department of Computer Science, Faculty of informatics, Mahasarakham University, Maha Sarakham 44000, Thailand
*
Author to whom correspondence should be addressed.
Received: 30 September 2018 / Revised: 8 December 2018 / Accepted: 20 December 2018 / Published: 26 December 2018
  |  
PDF [2111 KB, uploaded 26 December 2018]
  |  

Abstract

This article presents algorithms for solving a special case of the vehicle routing problem (VRP). We define our proposed problem of a special VRP case as a combination of two hard problems: the generalized assignment and the vehicle routing problem. The different evolution (DE) algorithm is used to solve the problem. The recombination process of the original DE is modified by adding two more sets of vectors—best vector and random vector—and using two other sets—target vector and trial vector. The linear probability formula is proposed to potentially use one out of the four sets of vectors. This is called the modified DE (MDE) algorithm. Two local searches are integrated into the MDE algorithm: exchange and insert. These procedures create a DE and MDE that use (1) no local search techniques, (2) two local search techniques, (3) only the exchange procedure, and (4) only the insert procedure. This generates four DE algorithms and four MDE algorithms. The proposed methods are tested with 15 tested instances and one case study. The current procedure is compared with all proposed heuristics. The computational result shows that, in the case study, the best DE algorithm (DE-4) has a 1.6% better solution than that of the current practice, whereas the MDE algorithm is 8.2% better. The MDE algorithm that uses the same local search as the DE algorithms generates a maximum 5.814% better solution than that of the DE algorithms. View Full-Text
Keywords: vehicle routing problem; assignment problem; differential evolution algorithm; local search; insertion; drug and medical instrument sales and service vehicle routing problem; assignment problem; differential evolution algorithm; local search; insertion; drug and medical instrument sales and service
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

Thongkham, M.; Kaewman, S. Methodology to Solve the Combination of the Generalized Assignment Problem and the Vehicle Routing Problem: A Case Study in Drug and Medical Instrument Sales and Service. Adm. Sci. 2019, 9, 3.

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.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Adm. Sci. EISSN 2076-3387 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top