routing optimization of fourth party logistics with reliability constraints based on messy ga
Article Quality & Performance Metrics
Readership in this journal
SteadyRanked #32 of 58 articles by views in research journal of environmental toxicology
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
Abstract
Purpose: The purpose of this paper is to choose a optimal routing in fourth party logistics (4PL) with the objective of transportation cost minimization under reliability level constraint.
Design/methodology/approach: Reliability theory is applied to routing optimization problem. A mathematical model of the 4PL routing optimization problem with reliability constraints is built, which aims to find a route at the minimum cost. Due to the 4PL routing problem is NP-hard, two algorithms are designed: Messy Genetic Algorithm (Messy GA) and Enumeration Algorithm (EA).
Findings: Through the model and algorithm, 4PL company can obtain the optimal solution quickly and effectively, according to customer’s reliability requirements.
Practical implications : We give an example for test the effectiveness of the method and the algorithm.
Originality/value: In this paper, we put objective factors that cause disturbances of transportation time into consideration, and reliability theory is applied to 4PL routing optimization problem. A Messy GA with double arrays encoding method is designed to solve the problem.
| Reference Key |
jia2014journalrouting
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Li Jia;Liu Yanqiu;Hu Zhongjun |
| Journal | research journal of environmental toxicology |
| Year | 2014 |
| DOI |
10.3926/jiem.1126
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.