Due to the inherent multiobjective nature of many network design and routing problems, there has been a tremendous increase in multiobjective network modeling in recent years. In this article we introduce one such mod...
详细信息
Due to the inherent multiobjective nature of many network design and routing problems, there has been a tremendous increase in multiobjective network modeling in recent years. In this article we introduce one such model, the minimum-covering/shortest-path (MinCSP) problem, and formulate several variations of the problem. The MinCSP problem is a two objective path problem: minimization of the total population negatively impacted by the path and minimization of the total path length. A population is considered to be negatively impacted by the path if the path comes within some predetermined distance of the population. Consequently, the MinCSP problem extends the concept of coverage from facility location modeling to network design. Additionally, several existing solution methods for the problem are briefly discussed and potential applications presented. [ABSTRACT FROM AUTHOR]
Some known results about lower and upper bounds for the number of distinct solutions to a discrete knapsack problem are given. In this paper some sharper bounds are proved by using geometrical methods. The proof of th...
详细信息
Large‐scale mixed‐integer linear programming (MILP) models may easily prove extraordinarily difficult to solve, even with efficient commercially implemented MILP solution codes. Drawing on experience gained in solvi...
详细信息
A major complication in the planning of facility systems and in the analysis of their locational configurations is the fluctuating nature of the systems they serve. Locations identified now, based on current condition...
详细信息
This paper addresses the questions of market penetration and locational conflict in a franchise system of distribution. The models developed provide a means to evaluate alternative scenarios and the effects of various...
详细信息
暂无评论