2019
DOI: 10.1007/978-3-030-29821-0_17
|View full text |Cite
|
Sign up to set email alerts
|

Integrated Scheduling of Production and Distribution Operations with Site Selection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 16 publications
0
5
0
Order By: Relevance
“…Constraint set (5) implies that each trip starts from the depot. Constraint sets (6) and (7) indicate that a vehicle cannot travel to the dummy depot from a supplier node or a manufacturer node, respectively. Constraint set (8) implies that the capacity of a given vehicle is not exceeded at any time during a trip.…”
Section: B Model Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…Constraint set (5) implies that each trip starts from the depot. Constraint sets (6) and (7) indicate that a vehicle cannot travel to the dummy depot from a supplier node or a manufacturer node, respectively. Constraint set (8) implies that the capacity of a given vehicle is not exceeded at any time during a trip.…”
Section: B Model Formulationmentioning
confidence: 99%
“…Some manufacturers employ sub-contractors that offer specific services at various locations in order to improve the efficiency of the supply chain network by reducing delivery times [6]. To ensure timely delivery of products, some manufacturers adhere to the distributed manufacturing process, which seeks to move their production sites closer to the location of demand [7]. An emerging concept, which is adopted by certain production companies to address the change and uncertainty associated with customer demand and other challenges related to supply chain management, is a "factory-in-a-box.…”
Section: Introductionmentioning
confidence: 99%
“…Check whether we have a minimum of N such executed history track segments or not; Initially, N could be 10, but it will be a parameter, which can be adjusted time, after obtaining enough data; (3) For those N historical data trips, compare the segments and count the paths that are similar to an acceptable percentage (e.g., more than 90%), as the common road traveled from X to X + 1; (4)…”
Section: Proposed Historical Routing Algorithmmentioning
confidence: 99%
“…Thus, the number of customers ordering online has increased and they are putting pressure on shipping companies because they want fast and cheap delivery. In order not to delay the delivery of goods, manufacturers adhere to the process of distributed manufacturing by moving production sites as close as possible to the location of demand [3]. Companies that 2 of 27 transport small packages minimize the cost by keeping up the routes of the drivers and want to build customer relationships by using the same agents to visit the same customers at about the same time every day [4], which is why it should come as no surprise that the vehicle routing problem (VRP) is a popular optimization problem when it comes to finding the best possible routes (several types of routing problems have been extended from the VRP).…”
Section: Introductionmentioning
confidence: 99%
“…Nevertheless, the simultaneous planning of production, distribution, and choosing facility location is a complex problem that can be solved with the help of exact solution methods with short computational times, but only for small-sized problems. This is due to the combination of three complex problems in the same case [61]. In order to solve bigger instances, new algorithms should be developed that help solve this novel type of simultaneous planning.…”
mentioning
confidence: 99%