scientific article; zbMATH DE number 1953194

MaRDI QIDQ4414640zbMATH OpenFDO

Authors Hipólito Hernández-Pérez, Juan-José Salazar-González

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2570/25700089.htm

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• The multi-commodity pickup-and-delivery traveling salesman problem
• The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

Cited in

(30)

• On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
• Single-commodity vehicle routing problem with pickup and delivery service
• The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
• Heuristics for the traveling salesman problem with pickup and delivery
• The travelling salesman problem with pick-up and delivery
• The merchant subtour problem
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• An exact algorithm for the Split-Demand One-Commodity Pickup-And-Delivery Travelling Salesman problem
• Inventory rebalancing and vehicle routing in bike sharing systems
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• The single-vehicle two-echelon one-commodity pickup and delivery problem
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
• Bike sharing systems: solving the static rebalancing problem
• Projection results for vehicle routing
• Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
• A multi-start evolutionary local search for the one-commodity pickup and delivery traveling salesman problem
• The multi-commodity pickup-and-delivery traveling salesman problem
• Balancing the stations of a self service ``bike hire system
• Load-dependent and precedence-based models for pickup and delivery problems
• An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
• The traveling salesman problem with pickup, delivery, and ride-time constraints
• A method for optimizing the collection of pallets using the traveling salesman problem
• Formalization of pickup and delivery problem
• The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
• The one‐commodity pickup and delivery travelling salesman problem on a path or a tree
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• The unit capacity pickup and delivery problem on a one-way loop
• The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem

This page was built for publication:

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