2010
DOI: 10.1007/978-3-642-13495-1_64
|View full text |Cite
|
Sign up to set email alerts
|

Solving Vehicle Assignment Problem Using Evolutionary Computation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
5
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 13 publications
1
5
0
Order By: Relevance
“…DPSO-2 uses constriction factor. Generally, these results support the solution addressed in [9][10] and validate the feasible solution derived for the EVAP. The number of vehicles generated based on the results from Table 1 were used for the following the computational results for multiple inundated areas.…”
Section: Results and Findingssupporting
confidence: 85%
See 2 more Smart Citations
“…DPSO-2 uses constriction factor. Generally, these results support the solution addressed in [9][10] and validate the feasible solution derived for the EVAP. The number of vehicles generated based on the results from Table 1 were used for the following the computational results for multiple inundated areas.…”
Section: Results and Findingssupporting
confidence: 85%
“…The objective function of the EVAP is to assign vehicles with the maximum number of people while the EVRP is to minimize the total travelling time for all the travelling vehicles to the inundated area. The problem formulation for EVAP can be referred in [10] meanwhile EVRP in [11]. Construction of solution representation defines and constructs solution representation for the EVAP and EVRP.…”
Section: Two-tier Solutionsmentioning
confidence: 99%
See 1 more Smart Citation
“…For instance, Jean et al [ 3 ] used PSO to solve the problem of allocating a set of cabs to some customers with the goal of minimizing the distance traveled by the fleet with result that showed that PSO is capable of achieving optimal results. Similarly, a discrete PSO (DPSO) and genetic algorithm (GA) were compared for the problems of finding optimal solution to the allocation of the expected number of people in flooded areas to various types of available vehicle in an evacuation process [ 6 ] with DPSO having better performance than GA. DPSO has also shown great performance with different degrees of difficult knapsack problems [ 7 , 8 ]. In addition, experimental results in [ 9 ] showed that DPSO algorithm is highly efficient for solving the multiple knapsack problems (MKP) even with large problem instances.…”
Section: Introductionmentioning
confidence: 99%
“…FastSLAM is a form of particle filter and can be considered as the second most used filter-based category in SLAM methods utilized to solve the SLAM problem. Apart from its implementation in SLAM, particle filters are also synonymous in path finding and searching methods for various other systems [23] [25]. FastSLAM was considered to be the first to model the non-linear processes and does not require Gaussian pose distribution in its method [3] [15].…”
Section: Fast Slammentioning
confidence: 99%