Theory and Methodology The general routing polyhedron: A unifying framework
نویسنده
چکیده
It is shown how to transform the General Routing Problem (GRP) into a variant of the Graphical Travelling Salesman Problem (GTSP). This transformation yields a projective characterisation of the GRP polyhedron. Using this characterisation, it is shown how to convert facets of the GTSP polyhedron into valid inequalities for the GRP polyhedron. The resulting classes of inequalities subsume several previously published classes. Ó 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Cooperative vehicle routing problem: an opportunity for cost saving
In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost savi...
متن کاملWhat is the philosophy of Islamic architecture (analysis of discipline's philosophy in architecture based on observation theory)
Lack of attention to the philosophy of architecture as an intermediate science between general philosophy and architecture science has caused many researchers to link their research to philosophy without methodology. They introduce their research as the philosophy of Islamic architecture; While the philosophy of Islamic architecture is a kind of philosophy. The general philosophy merely provide...
متن کاملA New Framework for Secure Routing in VANET
Vehicular Ad-Hoc Networks can enhance road safety and enable drivers to avoid different threats. Safety applications, mobile commerce, and other information services are among different available services that are affected by dynamic topology, vehicle’s speed and node misbehaving. Dynamic topology makes the route unstable and unreliable. So, improving the throughput and performance of VANET thr...
متن کاملA branch & cut algorithm for the windy general routing problem and special cases
In this paper we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real-life applications. The Branch & Cut method presented here is based on a cutting-plane algorithm that identifies violated inequalities of several classes of facet-inducing inequalities for the corresponding polyhedron. ...
متن کاملPossibility and necessity integrals
Abstract: In this paper, we introduce seminormed and semiconormed fuzzy integrals associated with confidence measures. These confidence measures have a field of sets as their domain, and a complete lattice as their codomain. In introducing these integrals, the analogy with the classical introduction of Legesgue integrals is explored and exploited. It is amongst other things shown that our integ...
متن کامل