Keywords: مشکل شماره گیری سوار; Parameterized complexity; Approximability; Dial-a-ride problem; Taxi-sharing;
مقالات ISI مشکل شماره گیری سوار (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: مشکل شماره گیری سوار; Electric vehicle; Dial-a-ride problem; Battery swapping; Evolutionary variable neighborhood search metaheuristic algorithm;
Keywords: مشکل شماره گیری سوار; Dial-a-ride problem; Healthcare; Variable neighborhood search; Tabu search;
Keywords: مشکل شماره گیری سوار; Dial-a-ride problem; Multiple periods; Driver consistency; Branch-and-Cut; Large neighborhood search;
Keywords: مشکل شماره گیری سوار; Vehicle scheduling; Health service; Memetic algorithm; Dial-a-ride problem; Multi-trip
Keywords: مشکل شماره گیری سوار; Dial-a-ride problem; Manpower planning; Branch-and-cut; Healthcare transportation
Keywords: مشکل شماره گیری سوار; Dial-a-Ride problem; Fuzzy logic; Transportation
Keywords: مشکل شماره گیری سوار; Dial-a-ride problem; Dynamic stochastic; Time-dependent; Variable neighborhood search; Multiple plan approach; Multiple scenario approach;
Keywords: مشکل شماره گیری سوار; Dial-a-ride problem; Link analysis; HITS; Topological ordering;
Keywords: مشکل شماره گیری سوار; Large neighborhood search; Column generation; Hybrid algorithm; Variable neighborhood search; Dial-a-ride problem;
Keywords: مشکل شماره گیری سوار; Dial-a-ride problem; Patient transportation; Combination restrictions; Bi-objective optimization; Multi-directional local search; Scheduling procedure
The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity
Keywords: مشکل شماره گیری سوار; Dial-a-ride problem; Fleet size and mix problem; Reconfigurable vehicles; Heterogeneous fleet; Large neighborhood search; Set-covering; Feasibility check;
Solving a selective dial-a-ride problem with logic-based Benders decomposition
Keywords: مشکل شماره گیری سوار; Transportation; Dial-a-Ride problem; Logic-based Benders decomposition; Combinatorial Benders cuts; Branch-and-check;
Models and algorithms for reliability-oriented Dial-a-Ride with autonomous electric vehicles
Keywords: مشکل شماره گیری سوار; Dial-a-Ride problem; ILP models; Resource constrained scheduling;
A distributed VNS algorithm for optimizing dial-a-ride problems in large-scale scenarios
Keywords: مشکل شماره گیری سوار; Variable neighborhood search; Dial-a-ride problem; Transportation; Demand-responsive transport; Distributed algorithms
The Dial-A-Ride Problem with Transfers
Keywords: مشکل شماره گیری سوار; Dial-A-Ride Problem; Transfers; Simple temporal problem; Large neighborhood search;
Combining multicriteria analysis and tabu search for dial-a-ride problems
Keywords: مشکل شماره گیری سوار; Dial-a-ride problem; Multicriteria analysis; Quality of service; Tabu search; Reference point method
A Granular Tabu Search algorithm for the Dial-a-Ride Problem
Keywords: مشکل شماره گیری سوار; Granular Tabu Search; Dial-a-Ride Problem
A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large city
Keywords: مشکل شماره گیری سوار; Metaheuristic; Variable neighborhood search; Transportation; Dial-a-ride problem; Demand-responsive transport
The heterogeneous pickup and delivery problem with configurable vehicle capacity
Keywords: مشکل شماره گیری سوار; Pickup and delivery problem; Heterogeneous vehicles; Adaptive large neighborhood search; Dial-a-ride problem; Configurable vehicle capacity
Pickup and delivery problem using metaheuristics techniques
Keywords: مشکل شماره گیری سوار; Dial-a-ride problem; Metaheuristic; Simulated Annealing; Genetic Algorithm; Particle Swarm Optimization; Artificial Immune System
Solving a dial-a-ride problem with a hybrid evolutionary multi-objective approach: Application to demand responsive transport
Keywords: مشکل شماره گیری سوار; Demand responsive transport; Dial-a-ride problem; Evolutionary algorithm; Multi-objective combinatorial optimization; Local search
Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
Keywords: مشکل شماره گیری سوار; Vehicle routing; On-demand transportation; Linear fractional program; Dial-a-ride problem; Column generation
Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
Keywords: مشکل شماره گیری سوار; Transportation; Dial-a-ride problem; Dynamic problem; Stochastic information; Metaheuristic; Variable neighborhood search; Multiple plan approach; Multiple scenario approach; Stochastic variable neighborhood search;
An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
Keywords: مشکل شماره گیری سوار; Transportation; Dial-a-ride problem; Exact algorithm; Heuristics
An integer LL-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays
Keywords: مشکل شماره گیری سوار; Dial-a-Ride Problem; Stochastic programming; Integer LL-shaped algorithm
A stochastic model for a vehicle in a dial-a-ride system
Keywords: مشکل شماره گیری سوار; Dial-a-ride problem; Erlang’s loss system; Interruptions
Dynamic pickup and delivery problems
Keywords: مشکل شماره گیری سوار; Vehicle routing; Dynamic; Stacker crane; Dial-a-ride problem; Pickup and delivery
Variable neighborhood search for the dial-a-ride problem
Keywords: مشکل شماره گیری سوار; Transportation; Dial-a-ride problem; Metaheuristic; Variable neighborhood search
Vehicle routing problems with alternative paths: An application to on-demand transportation
Keywords: مشکل شماره گیری سوار; Vehicle routing; Multigraph; Shortest path problem with resource constraints; Dynamic programming; On-demand transportation; Dial-a-ride problem
A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
Keywords: مشکل شماره گیری سوار; Transportation; Vehicle routing problem; Dial-a-ride problem; Heuristics