Matches in SemOpenAlex for { <https://semopenalex.org/work/W2156965367> ?p ?o ?g. }
Showing items 1 to 73 of
73
with 100 items per page.
- W2156965367 endingPage "1931" @default.
- W2156965367 startingPage "1922" @default.
- W2156965367 abstract "The vehicle routing problem is a combinatorial optimization and integer programming problem seeking to service a number of customers with a fleet of vehicles. Vehicle routing problem has many applications in the fields of transportation, distribution and logistics. In this study, the vehicle routing problem subject to precedence constraints has been modeled as the Travelling Salesman Problem (TSP) with precedence constraints. Vehicle routing problem is difficult to solve using exact methods especially for large size instances due to computational expensive. Therefore, metaheuristic method based genetic algorithm has been developed to obtain feasible and optimal solution with less computation time. The conventional genetic algorithm procedure for TSP, with an order-based representation might generate invalid candidate solutions when precedence constraints are involved. In order to obtain feasible solution which does not violate precedence constraints, a route repair based topological sort technique is used and integrated in the genetic algorithm procedure. In this paper, a new algorithm is developed and the performances as well as the quality of the solution were evaluated against large scale test problems. The results from the computational experiments demonstrate that the algorithm with ‘earliest position’ task selection mechanism, linear order crossover and inversion mutation has better results in terms of number of generations and computation time to converge to optimal solution. The genetic operators used in this study are capable to introduce new fitter offspring and does not trapped in a local optimum. Therefore, it can be stated that the genetic algorithm approach developed in this study is efficient in solving large scale vehicle routing problem subject to precedence constraints with the objective of minimizing the distance travelled." @default.
- W2156965367 created "2016-06-24" @default.
- W2156965367 creator A5006487123 @default.
- W2156965367 date "2015-07-01" @default.
- W2156965367 modified "2023-09-30" @default.
- W2156965367 title "An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints" @default.
- W2156965367 cites W194441499 @default.
- W2156965367 cites W1997039203 @default.
- W2156965367 cites W2018679674 @default.
- W2156965367 cites W2041643366 @default.
- W2156965367 cites W2129840223 @default.
- W2156965367 cites W2160352551 @default.
- W2156965367 doi "https://doi.org/10.1016/j.sbspro.2015.06.203" @default.
- W2156965367 hasPublicationYear "2015" @default.
- W2156965367 type Work @default.
- W2156965367 sameAs 2156965367 @default.
- W2156965367 citedByCount "12" @default.
- W2156965367 countsByYear W21569653672017 @default.
- W2156965367 countsByYear W21569653672018 @default.
- W2156965367 countsByYear W21569653672019 @default.
- W2156965367 countsByYear W21569653672020 @default.
- W2156965367 countsByYear W21569653672021 @default.
- W2156965367 countsByYear W21569653672022 @default.
- W2156965367 countsByYear W21569653672023 @default.
- W2156965367 crossrefType "journal-article" @default.
- W2156965367 hasAuthorship W2156965367A5006487123 @default.
- W2156965367 hasBestOaLocation W21569653671 @default.
- W2156965367 hasConcept C109718341 @default.
- W2156965367 hasConcept C11413529 @default.
- W2156965367 hasConcept C122507166 @default.
- W2156965367 hasConcept C123784306 @default.
- W2156965367 hasConcept C126255220 @default.
- W2156965367 hasConcept C154945302 @default.
- W2156965367 hasConcept C175859090 @default.
- W2156965367 hasConcept C31258907 @default.
- W2156965367 hasConcept C33923547 @default.
- W2156965367 hasConcept C41008148 @default.
- W2156965367 hasConcept C45374587 @default.
- W2156965367 hasConcept C74172769 @default.
- W2156965367 hasConcept C8880873 @default.
- W2156965367 hasConceptScore W2156965367C109718341 @default.
- W2156965367 hasConceptScore W2156965367C11413529 @default.
- W2156965367 hasConceptScore W2156965367C122507166 @default.
- W2156965367 hasConceptScore W2156965367C123784306 @default.
- W2156965367 hasConceptScore W2156965367C126255220 @default.
- W2156965367 hasConceptScore W2156965367C154945302 @default.
- W2156965367 hasConceptScore W2156965367C175859090 @default.
- W2156965367 hasConceptScore W2156965367C31258907 @default.
- W2156965367 hasConceptScore W2156965367C33923547 @default.
- W2156965367 hasConceptScore W2156965367C41008148 @default.
- W2156965367 hasConceptScore W2156965367C45374587 @default.
- W2156965367 hasConceptScore W2156965367C74172769 @default.
- W2156965367 hasConceptScore W2156965367C8880873 @default.
- W2156965367 hasLocation W21569653671 @default.
- W2156965367 hasOpenAccess W2156965367 @default.
- W2156965367 hasPrimaryLocation W21569653671 @default.
- W2156965367 hasRelatedWork W1515023053 @default.
- W2156965367 hasRelatedWork W1990084143 @default.
- W2156965367 hasRelatedWork W2126939445 @default.
- W2156965367 hasRelatedWork W2372298730 @default.
- W2156965367 hasRelatedWork W2380898791 @default.
- W2156965367 hasRelatedWork W2577211051 @default.
- W2156965367 hasRelatedWork W2788827884 @default.
- W2156965367 hasRelatedWork W2795127331 @default.
- W2156965367 hasRelatedWork W2889011143 @default.
- W2156965367 hasRelatedWork W565128109 @default.
- W2156965367 hasVolume "195" @default.
- W2156965367 isParatext "false" @default.
- W2156965367 isRetracted "false" @default.
- W2156965367 magId "2156965367" @default.
- W2156965367 workType "article" @default.