Customer selection and profit maximization in vehicle routing problems

zbMATH Open1114.90311MaRDI QIDQ3416539FDOQ3416539

Authors: Deniz Aksen, Necati Aras 

Publication date: 22 January 2007

Recommendations

• The undirected capacitated general routing problem with profits
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
• Traveling salesman problems with profits and stochastic customers
• Algorithms for the Vehicle Routing Problems with Time Deadlines
• The undirected capacitated arc routing problem with profits

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cited In (4)

• The vehicle routing problem with profits and consistency constraints
• The r‐interdiction selective multi‐depot vehicle routing problem
• An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
• Customer-oriented vehicle routing problem with environment consideration: two-phase optimization approach and heuristic solution

This page was built for publication: Customer selection and profit maximization in vehicle routing problems

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