Abstract
<title>Abstract</title> The coordinated optimization of production and transportation ensures that enterprises can lower the total cost of the supply chain while providing high-quality products to consumers, thereby increasing company profits. The integrated distributed no-wait flow-shop scheduling and vehicle routing problem (DNFSVRP) is considered for a make-to-order (MTO) manufacturer. A mathematical model with the objective of minimizing the maximum delivery time is established. For the DNFSVRP, three vectors are designed to represent the solution encoding and an improved artificial bee colony (IABC) algorithm with problem-specific knowledge is proposed. Firstly, an ECT-2-machine method is introduced to generate high-quality initial solutions. Secondly, in the employed bee phase, eight neighborhood structures are designed to expand the search space. Moreover, in the onlooker bee phase, a path relinking strategy is adopted to fully utilize the information of the best solution and accelerate the convergence speed of the algorithm. Furthermore, in the scout bee phase, a destrucction and reconstruction operation based on problem-specific knowledge is designed to effectively balance the breadth and depth of the search. Finally, five sets of comparative experiments are conducted, and the results demonstrate the effectiveness of the IABC algorithm in addressing the DNFSVRP.
Affiliated Institutions
Related Publications
Ant Algorithms for Discrete Optimization
This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' for...
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
We present a new local optimizer called SOP-3-exchange for the sequential ordering problem that extends a local search for the traveling salesman problem to handle multiple cons...
A unified approach to loop-free routing using distance vectors or link states
We present a unified approach for the dynamic computation of shortest paths in a computer network using either distance vectors or link states. We describe a distributed algorit...
Ant system: optimization by a colony of cooperating agents
An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call ant system (AS). We propose it as a viable new approach...
Dynamic Scheduling and Division of Labor in Social Insects
A method for assigning tasks or resources, based on a model of division of labor in social insects, is introduced and applied to a dynamic flow shop scheduling problem. The prob...
Publication Info
- Year
- 2025
- Type
- article
- Citations
- 0
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.21203/rs.3.rs-7373477/v1