In this paper, a multi-perspective decision support system (MP-DSS)‎ ‎to design hierarchical public transportation network is developed‎. ‎Since this problem depends on different perspectives‎, ‎MP-DSS consists of two sub-systems with macro and micro sub-systems based on travel information‎, ‎land use and expert knowledge‎. ‎In the micro sub-system‎, ‎two sub-modules are developed considering o...

This study introduces the One-Commodity Pickup and Delivery Traveling Salesman Problem with Demand Intervals (1-PDTSP-DI), a generalization of the One Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP). In the 1-PDTSP-DI, the vertices are required to have an inventory lying between given lower and upper bounds and initially have an inventory which does not necessarily lie betwee...

We show by a counterexample that the dual-ascent procedure proposed by Herrmann, Ioannou, Minis and Proth in a 1996 issue of the European Journal of Operational Research is incorrect in the sense that it does not generate a valid lower bound to the optimal value of xed-charge capacitated network design problems. We provide a correct dual-ascent procedure based on the same ideas and we give an i...

This paper proposes a new heuristicmethod for the logistics network design and planning problem based on linear relaxation and DC (difference of convex functions) programming. We consider a multi-period, multi-echelon,multi-commodity andmulti-product problemdefined as a large scalemixed integer linear programming (MILP) model. The method is experimented on data sets of various size. The numeric...

In this paper, we study a multi-echelon uncapacitated lot-sizing problem in series (mULS), where the output of the intermediate echelons has its own external demand, and is also an input to the next echelon. We propose a polynomial-time dynamic programming algorithm, which gives a tight, compact extended formulation for the two echelon case (2-ULS). Next, we present a family of valid inequaliti...

Genetic algorithms and other evolutionary algorithms have been successfully applied to solve constrained minimum spanning tree problems in a variety of communication network design problems. Here we propose a multi population genetic algorithm for yet another communication design problem. The new problem is modeled through a hop-constrained minimum spanning tree also exhibiting the characterist...

Genetic algorithms and other evolutionary algorithms have been successfully applied to solve constrained minimum spanning tree problems in a variety of communication network design problems. Here we propose a multi population genetic algorithm for yet another communication design problem. The new problem is modeled through a hop-constrained minimum spanning tree also exhibiting the characterist...