2019
DOI: 10.1007/s00607-018-00693-1
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective multi-mode resource constrained project scheduling problem using Pareto-based algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
39
0
1

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
4

Relationship

3
7

Authors

Journals

citations
Cited by 92 publications
(40 citation statements)
references
References 42 publications
0
39
0
1
Order By: Relevance
“…• As the number of objectives increase, more information has to be given by the user. Assume that it is decided to minimize Objective Function (53) subject to Constraints (54) and (55).…”
Section: Solution Techniquementioning
confidence: 99%
“…• As the number of objectives increase, more information has to be given by the user. Assume that it is decided to minimize Objective Function (53) subject to Constraints (54) and (55).…”
Section: Solution Techniquementioning
confidence: 99%
“…The VRP problem is a NP-hard problem. Therefore, it is natural to use a heuristic to solve the problem [32], such as the adaptive Harmony Search Algorithm (HSA) [33], adaptive Large Neighborhood Search (LNS) algorithm [34], Iterated Greedy Algorithm (IGA) [35], Genetic Algorithm (GA) [3] and Particle Swarm Optimization (PSO) algorithm [36], Simulated Annealing Algorithm (SAA) [28,37,38], Multiple Neighborhood Search (MNS) algorithm [24], etc.…”
Section: Research About Some Algorithms For Waste Collection and Tranmentioning
confidence: 99%
“…Equation (41) calculates total transportation costs among different echelons of the supply chain. Equation (42) states that the total supply chain costs are equal to the configuration, transportation, and operation costs.…”
Section: Physical and Financial Flow Integration Constraintsmentioning
confidence: 99%