Simulated annealing heuristic for the general share-a-ride problem

DOI10.1080/0305215X.2018.1437153OpenAlexW2794430075WikidataQ130164316 ScholiaQ130164316MaRDI QIDQ5058863

Sesya Sri Purwanti, A. A. N. Perwira Redi, Suprayogi Suprayogi, Chung-Cheng Lu, Parida Jewpanya, Vincent F. Yu

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2018.1437153

zbMATH Keywords

simulated annealingshare-a-ride problemride sharinggeneral share-a-ride problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (4)

Designing a model for service facility protection with a time horizon based on tri-level programming ⋮ Optimizing the production schedule of an agricultural cooperative: a case study ⋮ Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed ⋮ Evolutionary job scheduling with optimized population by deep reinforcement learning

Cites Work

• Optimization by Simulated Annealing
• The share-a-ride problem: people and parcels sharing taxis
• A simulated annealing heuristic for the open location-routing problem
• An adaptive large neighborhood search heuristic for the share-a-ride problem
• A two-phase tabu search approach to the location routing problem
• Future paths for integer programming and links to artificial intelligence
• Optimization for dynamic ride-sharing: a review
• The dial-a-ride problem: Models and algorithms
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Parallel iterative search methods for vehicle routing problems
• A guide to vehicle routing heuristics
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: Simulated annealing heuristic for the general share-a-ride problem