A grouping genetic algorithm for the pickup and delivery problem with time windows
From MaRDI portal
Publication:1764201
DOI10.1007/s00291-004-0173-7zbMath1176.90238MaRDI QIDQ1764201
Publication date: 24 February 2005
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-004-0173-7
68T05: Learning and adaptive systems in artificial intelligence
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
Related Items
Verification of Correctness of Parallel Algorithms in Practice, New Notation and Classification Scheme for Vehicle Routing Problems, Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems, A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints, Route planning for a seaplane service: the case of the Greek islands, A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system, A particle swarm optimizer for grouping problems, Shipper collaboration in forward and reverse logistics, Real-time control of freight forwarder transportation networks by integrating multimodal transport chains, An indirect search algorithm for disaster restoration with precedence and synchronization constraints, Granular tabu search for the pickup and delivery problem with time windows and electric vehicles, Grouping evolution strategies: an effective approach for grouping problems, Mixed-integer linear optimization for full truckload pickup and delivery, A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets, Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care, Indirect search for the vehicle routing problem with pickup and delivery and time windows, A new VRPPD model and a hybrid heuristic solution approach for e-tailing, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
