A Class of Euclidean Routing Problems with General Route Cost Functions

DOI10.1287/moor.15.2.268zbMath0721.90045OpenAlexW2073063202MaRDI QIDQ5753735

Awi Federgruen, Shoshana Anily

Publication date: 1990

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2513987e23551a2deb458a70e042fc2903822c67

zbMATH Keywords

heuristicsprobabilistic analysisvehiclecircular regional partitioning scheme

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

The general multi-retailer EOQ problem with vehicle routing costs ⋮ A partition approach to the inventory/routing problem ⋮ Routing problems: A bibliography ⋮ Model and algorithm for inventory/routing decision in a three-echelon logistics system ⋮ An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem ⋮ New mathematical model for the bi-objective inventory routing problem with a step cost function: a multi-objective particle swarm optimization solution approach ⋮ A practical solution approach for the cyclic inventory routing problem

This page was built for publication: A Class of Euclidean Routing Problems with General Route Cost Functions