The swapping problem

DOI10.1002/NET.3230220408MaRDI QIDQ4018998zbMATH OpenOpenAlexFDO

Authors Shoshana Anily, Refael Hassin

Publication date 16 January 1993

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230220408

zbMATH Keywords

patchingswapping problempolynomial approximation algorithmsshortest routes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Recommendations

• Heuristics for the mixed swapping problem
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• The preemptive swapping problem on a tree
• The uncapacitated swapping problem on a line and on a circle
• A branch-and-cut algorithm for the preemptive swapping problem

Cited in

(35)

• Preemptive stacker crane problem: extending tree-based properties and construction heuristics
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• The Swapping Problem on a Line
• The bipartite travelling salesman problem: a pyramidally solvable case
• Tree based models and algorithms for the preemptive asymmetric stacker crane problem
• Approximation algorithms for the Euclidean bipartite TSP
• Feasibility recovery for the unit-capacity constrained permutation problem
• Polynomially solvable cases of the bipartite traveling salesman problem
• The unit-capacity constrained permutation problem
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• The static bicycle relocation problem with demand intervals
• The vehicle routing problem with pickups and deliveries on some special graphs
• The uncapacitated swapping problem on a line and on a circle
• A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
• One-to-many-to-one single vehicle pickup and delivery problems
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• On the theoretical properties of swap multimoves
• Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
• Heuristics for the mixed swapping problem
• Balancing the stations of a self service ``bike hire system
• Dynamic pickup and delivery problems
• Bike sharing systems: solving the static rebalancing problem
• Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
• Geometric planar networks on bichromatic collinear points
• Analysis of the gift exchange problem
• A branch-and-cut algorithm for the nonpreemptive swapping problem
• Solving the shortest route cut and fill problem using simulated annealing
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
• The preemptive swapping problem on a tree
• An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Approximation algorithms for the Geometric Covering Salesman Problem
• A truck scheduling problem arising in intermodal container transportation
• A branch-and-cut algorithm for the preemptive swapping problem
• A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem

This page was built for publication: The swapping problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018998)