Matches in SemOpenAlex for { <https://semopenalex.org/work/W2004109780> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W2004109780 endingPage "1249" @default.
- W2004109780 startingPage "1237" @default.
- W2004109780 abstract "Abstract Electric bus scheduling problem can be defined as vehicle scheduling problem with route and fueling time constraints (VSPRFTC). Every vehicle’s travel miles (route time) after charging is limited, thus the vehicle must be recharged after taking several trips and the minimal charging time (fueling time) must be satisfied. A multiple ant colony algorithm (ACA) was presented to solve VSPRFTC based on ACA used to solve traveling salesman problem (TSP), a new metaheuristic approach inspired by the foraging behavior of real colonies of ants. The VSPRFTC considered in this paper minimizes a multiple, hierarchical objective function: the first objective is to minimize the number of tours (or vehicles) and the second is to minimize the total deadhead time. New improvement of ACA as well as detailed operating steps was provided on the basis of former algorithm. Then in order to settle contradiction between accelerating convergence and avoiding prematurity or stagnation, improvement on route construction rule and Pheromone updating rule was adopted. A group feasible trip sets (blocks) had been produced after the process of applying ACA. In dealing with the fueling time constraint a bipartite graphic model and its optimization algorithm are developed for trip set connecting in a hub and spoke network system to minimize the number of vehicle required. The maximum matching of the bipartite graph is obtained by calculating the maximum inflow with the Ford–Fulkerson algorithm. At last, an example was analyzed to demonstrate the correctness of the application of this algorithm. It proved to be more efficient and robust in solving this problem." @default.
- W2004109780 created "2016-06-24" @default.
- W2004109780 creator A5014255005 @default.
- W2004109780 creator A5034466750 @default.
- W2004109780 date "2007-07-01" @default.
- W2004109780 modified "2023-09-23" @default.
- W2004109780 title "Heuristic approaches for solving transit vehicle scheduling problem with route and fueling time constraints" @default.
- W2004109780 cites W15274158 @default.
- W2004109780 cites W1975666411 @default.
- W2004109780 cites W1983511967 @default.
- W2004109780 cites W2005650729 @default.
- W2004109780 cites W2015455321 @default.
- W2004109780 cites W2029970827 @default.
- W2004109780 cites W2040454839 @default.
- W2004109780 cites W2088175460 @default.
- W2004109780 cites W2090435272 @default.
- W2004109780 doi "https://doi.org/10.1016/j.amc.2007.02.141" @default.
- W2004109780 hasPublicationYear "2007" @default.
- W2004109780 type Work @default.
- W2004109780 sameAs 2004109780 @default.
- W2004109780 citedByCount "62" @default.
- W2004109780 countsByYear W20041097802012 @default.
- W2004109780 countsByYear W20041097802013 @default.
- W2004109780 countsByYear W20041097802014 @default.
- W2004109780 countsByYear W20041097802015 @default.
- W2004109780 countsByYear W20041097802016 @default.
- W2004109780 countsByYear W20041097802017 @default.
- W2004109780 countsByYear W20041097802018 @default.
- W2004109780 countsByYear W20041097802019 @default.
- W2004109780 countsByYear W20041097802020 @default.
- W2004109780 countsByYear W20041097802021 @default.
- W2004109780 countsByYear W20041097802022 @default.
- W2004109780 countsByYear W20041097802023 @default.
- W2004109780 crossrefType "journal-article" @default.
- W2004109780 hasAuthorship W2004109780A5014255005 @default.
- W2004109780 hasAuthorship W2004109780A5034466750 @default.
- W2004109780 hasConcept C111919701 @default.
- W2004109780 hasConcept C126255220 @default.
- W2004109780 hasConcept C173801870 @default.
- W2004109780 hasConcept C206729178 @default.
- W2004109780 hasConcept C33923547 @default.
- W2004109780 hasConcept C41008148 @default.
- W2004109780 hasConcept C42475967 @default.
- W2004109780 hasConcept C55416958 @default.
- W2004109780 hasConcept C68387754 @default.
- W2004109780 hasConceptScore W2004109780C111919701 @default.
- W2004109780 hasConceptScore W2004109780C126255220 @default.
- W2004109780 hasConceptScore W2004109780C173801870 @default.
- W2004109780 hasConceptScore W2004109780C206729178 @default.
- W2004109780 hasConceptScore W2004109780C33923547 @default.
- W2004109780 hasConceptScore W2004109780C41008148 @default.
- W2004109780 hasConceptScore W2004109780C42475967 @default.
- W2004109780 hasConceptScore W2004109780C55416958 @default.
- W2004109780 hasConceptScore W2004109780C68387754 @default.
- W2004109780 hasIssue "2" @default.
- W2004109780 hasLocation W20041097801 @default.
- W2004109780 hasOpenAccess W2004109780 @default.
- W2004109780 hasPrimaryLocation W20041097801 @default.
- W2004109780 hasRelatedWork W1965402973 @default.
- W2004109780 hasRelatedWork W2056085356 @default.
- W2004109780 hasRelatedWork W2064344559 @default.
- W2004109780 hasRelatedWork W2065163424 @default.
- W2004109780 hasRelatedWork W2088389093 @default.
- W2004109780 hasRelatedWork W2114927918 @default.
- W2004109780 hasRelatedWork W2188917685 @default.
- W2004109780 hasRelatedWork W2520902986 @default.
- W2004109780 hasRelatedWork W2546696010 @default.
- W2004109780 hasRelatedWork W3035289691 @default.
- W2004109780 hasVolume "190" @default.
- W2004109780 isParatext "false" @default.
- W2004109780 isRetracted "false" @default.
- W2004109780 magId "2004109780" @default.
- W2004109780 workType "article" @default.