Purpose: To develop LIRP (location-inventory-routing problem) model with considering multiple links and solve it using method of heuristic based on algorithm of simulated annealing. Method of heuristic for the LIRP model is applied in city of Jakarta to improve effectiveness and efficiency of...

This paper analyzes convex congestion network problems. It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore, an easy way of determining if a given network is...