연구동향 분석
박사

스쿨 버스 라우팅 문제의 특성과 알고리듬에 관한 연구 : The School Bus Routing Problem: Problem Characteristics and Algorithms

박준혁 2011년

논문상세정보
인용/피인용
' 스쿨 버스 라우팅 문제의 특성과 알고리듬에 관한 연구 : The School Bus Routing Problem: Problem Characteristics and Algorithms' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • Combinatorial optimization
  • Heuristics
  • mixed load
  • school bus routing
  • vehicle routing problem
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
24 0

0.0%

' 스쿨 버스 라우팅 문제의 특성과 알고리듬에 관한 연구 : The School Bus Routing Problem: Problem Characteristics and Algorithms' 의 참고문헌

  • Worstcaseperformance bounds for simple one-dimensional packing algorithms
    Johnson [1974]
  • Vehicles scheduling with sliding time windows
    Ferland [1989]
  • Transportation cost changes with statewide school districtconsolidation
    Hanley [2007]
  • The vehicle routing problem
    Toth, Paolo [2002]
  • The school bus routing problem: a case study
    Li [2002]
  • The school bus routing problem: A review
    Park [2010]
  • The savings algorithm for the vehicle routing problem
    Paessens [1988]
  • The pickup and delivery problem withtransfers: Formulation and a branch-and-cut solution method
    Corts [2010]
  • The pickup and delivery problem with timewindows
    Dumas [1991]
  • The open vehicle routing problem: algorithms, largescaletest problems, and computational results
    Li The open vehicle routing problem: algorithms [2007]
  • The multiple TSP with time windows:vehicle bounds based on precedence graphs
  • The fleet size and mix vehiclerouting problem
    Golden [1984]
  • The Hungarian Method for the assignment problem
    Kuhn,H. [1955]
  • Tabu search for a multi-objective routing problem
    Pacheco [2006]
  • TRANSCOL: a multi-period school bus routing and scheduling system
    Desrosiers [1986]
  • Solving school bus routing problems through integerprogramming
    Bekta [2007]
  • Solving a school bus scheduling problem with integerprogramming
    Fgenschuh [2009]
  • Separatingcapacity constraints in the CVRP using tabu search
    Augerat [1998]
  • School-bus routing for program scheduling
    Bookbinder [1990]
  • School bus routing using genetic algorithms
    Thangiah [1992]
  • School bus routing by computer
    Bennett [1972]
  • School bus routing and scheduling: Anexpert system approach
    Chen [1988]
  • School bus routes generator in urbansurroundings
    Dulac [1980]
  • Scheduling school buses
    Swersey [1984]
  • Scheduling of vehicles from a central depot to a number ofdelivery points
    Clarke [1964]
  • Scatter search for the vehicle routing problem withtime windows
    Russell [2006]
  • Scatter search for a real-lifeheterogeneous fleet vehicle routing problem with time windows and split deliveriesin Brazil
    Belfiore [2008]
  • Rural school vehicle routing problem
    Ripplinger [2005]
  • Routing special-education school buses
    Russell [1986]
  • Routing and scheduling ofvehicles and crews: the state of the art
    Bodin [1983]
  • Routing and scheduling of school buses by computer
    Bodin [1979]
  • Riding the school bus: a comparisonof the rural and suburban experience in five states
    Howley [2001]
  • Perspectives on practical aspects of truck routing and scheduling
    Ronen [1988]
  • On equity in providing public services
    Savas [1978]
  • Newheuristics for the vehicle routing problem
    Cordeau [2005]
  • Multi-objective vehicle routing problems
    Jozefowiez [2008]
  • Methods for routing withtime windows
    Desrosiers [1986]
  • Metaheuristics for the capacitated VRP
    Gendreau [2002]
  • Location-routing: issues, models and methods
    Nagy Location-routing: issues [2007]
  • Location-routing problems
    Laporte [1988]
  • Integer linear programming formulations of multiplesalesman problems and its variation
    Kara [2006]
  • Heuristic solutions to theproblem of routing school buses with multiple objectives
    Corbern [2002]
  • Handbooks inoperations research and management science volume 8: network routing
    Ball [1995]
  • Design of school bus routes by computer
    Newton [1969]
  • Depth-first search and linear graph algorithms
    Tarjan [1972]
  • Decision-aiding methodology for theschool bus routing and scheduling problem
    Spada [2005]
  • Coordinated transportation systems: analternative approach to traditional independent systems
    Baker [1993]
  • Computer-assisted schoolbus scheduling
    Angel [1972]
  • Computer solutions of the traveling salesman problem
    Lin [1965]
  • Combined vehicle routing and scheduling withtemporal precedence and synchronization constraints
    Bredstrom [2008]
  • Combined location-routing problems: asynthesis and future research directions
    Min [1998]
  • Combinatorics and Partially Ordered Sets
    Trotter [1992]
  • Clustering for routing in denselypopulated areas
    Chapleau [1985]
  • Classical heuristics for the capacitated VRP
    Laporte [2002]
  • Bus routing in a multi-school system
    Newton [1974]
  • Automated pupil transportation
    Verderber [1974]
  • Assigning buses to schedules in ametropolitan area
    Gavish [1978]
  • Arc routing problems, Part II: the ruralpostman problem
    Eiselt Arc routing problems [1995]
  • Anoverview of a school busing system
    Desrosiers [1981]
  • An improvement in Gavish-Shlifer algorithm for a class oftransportation scheduling problems
    White [1982]
  • An improved ant colony optimization forvehicle routing problem
    Bin [2009]
  • An effective heuristic for the M-TOUR traveling salesman problemwith some wide conditions
    Russell [1977]
  • An approach for solving a class of transportationscheduling problems
    Gavish [1979]
  • Algorithms for the vehicle routing and scheduling problems withtime window constraints
    Solomon [1987]
  • A variable neighbourhood search algorithmfor the open vehicle routing problem
    Fleszar [2009]
  • A taxonomic structure for vehicle routing and scheduling problems
    Bodin [1975]
  • A procedure for computing the K best solution to discreteoptimization problems and its application to the shortest path problem
    Lawler [1972]
  • A new tabu search heuristic for the open vehicle routingproblem
    Fu [2005]
  • A multiplier adjustmentmethod for the generalized assignment problem
    Fisher [1986]
  • A multi-objective optimization approach tourban school bus routing: formulation and solution method
    Bowerman [1995]
  • A location based heuristic for general routingproblems
    Bramel [1995]
  • A hybridevolution strategy for the open vehicle routing problem, Computers and Operations
    Repoussis A hybridevolution strategy for the open vehicle routing problem [2008]
  • A heuristic algorithm for the vehicle dispatch problem
    Gillett,B. [1974]
  • A generalized assignment heuristic for the vehiclerouting problem
    Fisher [1981]
  • A computerized approach to theNew York City school bus routing problem
    Braca [1997]
  • A computer assisted school bus routing strategy:a case study
    Hargroves [1981]
  • A comparison of heuristics for a school busscheduling problem
    Graham [1986]
  • A case study: school bus routing
    Simchi-Levi [2005]
  • A bus routing system for rural schooldistricts
    Chen [1990]
  • A branch-and-cut algorithm for thecapacitated open vehicle routing problem
    Letchford [2007]