Yogesh Agarwal - Academia.edu (original) (raw)
Papers by Yogesh Agarwal
Solving the team orienteering problem with nonidentical agents: A Lagrangian approach
Networks
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries
Networks
A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
Operations Research Letters
New Valid Inequalities for the Optimal Communication Spanning Tree Problem
INFORMS Journal on Computing
Design of Capacitated Multicommodity Networks with Multiple Facilities
Operations Research, Mar 1, 2002
Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
Operations Research, Jun 1, 2012
ABSTRACT In this paper we consider the well-known fixed-charge transportation problem. To send an... more ABSTRACT In this paper we consider the well-known fixed-charge transportation problem. To send any flow from source s i to destination t j , we incur a unit variable shipping cost of c ij and a fixed cost f ij . Here we study the structure of the projection polyhedron of this problem, in the space of 0-1 variables associated with fixed charges, and we develop several classes of valid inequalities and derive conditions under which they are facet defining. In some cases, if the conditions are not satisfied, we show how they can be lifted to define facets. Several heuristics for generating and adding these facets are presented. Using these results, we develop a computationally effective algorithm for solving the problem. The computational results clearly indicate the usefulness of this approach.
Set Partitioning Approach to Vehicle Routing
Networks, 1989
Solving the two-facility network design problem with 3-partition facets
Networks, 2015
European Journal of Operational Research, 2014
In this paper we study the problem of designing a survivable telecommunication network with share... more In this paper we study the problem of designing a survivable telecommunication network with shared-protection routing. We develop a heuristic algorithm to solve this problem. Recent results in the area of global rerouting have been used to obtain very tight lower bounds for the problem. Our results indicate that in a majority of problem instances, the average gap between the heuristic solutions and the lower bounds is within 5%. Computational experience is reported on randomly generated problem instances with up to 35 nodes, 80 edges and 595 demand pairs and also on the instances available in SNDlib database.
Journal of Advances in Management Research, 2013
Purpose-The ocean transportation of automobiles is carried out by specialized Roll-on/Roll-off sh... more Purpose-The ocean transportation of automobiles is carried out by specialized Roll-on/Roll-off ships, which are designed to carry a large number of automobiles at a time. Many of these shipping companies have vertically integrated or collaborated with other logistics services providers to offer integrated maritime logistics solution to car manufacturers. The purpose of this study is to develop an optimization model to address the tactical level maritime logistics planning for such a company. Design/methodology/approach-The problem is formulated as a mixed integer linear program and we propose an iterative combined Ant colony and linear programming-based solution technique for the same. Findings-This paper can integrate the maritime transportation planning of internally managed cargoes with the inventory management at the loading and discharging ports to minimize supplychain cost and also maximize additional revenue through optional cargoes using same fleet of ships. Research limitations/implications-The mathematical model does not consider the variability in production and consumption of products across various locations, travel times between different nodes, etc. Practical implications-The suggested mathematical model to the supply-chain planning problem and solution technique can be considered in the development of decision support system for operations planning. Originality/value-This paper extends the maritime inventory routing model by considering simultaneous planning of optional cargoes with internally managed cargoes.
A Polyhedral Approach for Solving Two Facility Network Design Problem
Lecture Notes in Computer Science, 2011
ABSTRACT The paper studies the problem of designing telecommunication networks using transmission... more ABSTRACT The paper studies the problem of designing telecommunication networks using transmission facilities of two different capacities. The point-to-point communication demands are met by installing a mix of facilities of both capacities on the edges to minimize total cost. We consider 3-partitions of the original graph which results in smaller 3-node subproblems. The extreme points of this subproblem polyhedron are enumerated using a set of proposed theorems. We introduce a new approach for computing the facets of the 3-node problem based on polarity theory after obtaining the extreme points. The facets of the subproblem are then translated back to those of the original problem using an extended version of a previously known theorem. We have tested our approach on several randomly generated and real life networks. The computational results show that 3-partition facets reduce the integrality gap by approximately 30-50% compared to that provided by 2-partition facets. Also there is a substantial reduction in the size of the branch-and-bound tree if these facets are used.
Polyhedral structure of the 4-node network design problem
Networks, 2009
ABSTRACT This article studies the polyhedral structure of the 4-node network design problem (NDP)... more ABSTRACT This article studies the polyhedral structure of the 4-node network design problem (NDP). Using a theorem from the previous work of this author, the facets of the 4-node NDP can be translated into facets of larger size problems. The knowledge of complete polyhedral description of the 4-node NDP is important because it implies complete knowledge of 4-partition-based facets of larger NDPs. After reviewing the previously known facets of the 4-node NDP, a new class of facets is derived. An enumerative methodology is presented for determining whether a given set of inequalities provides a complete polyhedral description. By implementing this methodology in a computer code, it is determined that the known facets of the 4-node NDP indeed provide a complete polyhedral description of the problem. Working of the proof methodology is illustrated with examples, and the results of the computer enumeration are reported. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009
An Algorithm for Designing Survivable Networks
AT&T Technical Journal, 1989
The author considers the design of telecommunications networks using high-capacity transport faci... more The author considers the design of telecommunications networks using high-capacity transport facilities that can survive under a single-link failure scenario. The model considers three priority levels for circuits: high, normal, and low. Each high-priority circuit is assigned ...
A Benders' Partitioning Approach for Solving the Optimal Communication Spanning Tree Problem
Modeling, Computation and Optimization, 2009
Chapter 15 A Benders' Partitioning Approach for Solving the Optimal Communication Spanni... more Chapter 15 A Benders' Partitioning Approach for Solving the Optimal Communication Spanning Tree Problem Yogesh K. Agarwal Decision Sciences Group Indian Institute of Management, Lucknow 226013, India e-mail: yka@ iiml. ac. in Prabha Sharma Department of ...
Optimal relay placement in Wireless Sensor networks using node cut inequalities
2012 Fourth International Conference on Communication Systems and Networks (COMSNETS 2012), 2012
Optimal relay placement problem arises in wireless sensor network designs, where additional relay... more Optimal relay placement problem arises in wireless sensor network designs, where additional relay nodes are to be placed at a subset of given potential relay locations in order to transmit data from already existing source nodes to a base station known as root node. The relay nodes have a certain specified transmission radius and cannot transmit data beyond it. In
Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
Operations Research, 2012
ABSTRACT In this paper we consider the well-known fixed-charge transportation problem. To send an... more ABSTRACT In this paper we consider the well-known fixed-charge transportation problem. To send any flow from source s i to destination t j , we incur a unit variable shipping cost of c ij and a fixed cost f ij . Here we study the structure of the projection polyhedron of this problem, in the space of 0-1 variables associated with fixed charges, and we develop several classes of valid inequalities and derive conditions under which they are facet defining. In some cases, if the conditions are not satisfied, we show how they can be lifted to define facets. Several heuristics for generating and adding these facets are presented. Using these results, we develop a computationally effective algorithm for solving the problem. The computational results clearly indicate the usefulness of this approach.
Design of Survivable Networks Using Three- and Four-Partition Facets
Operations Research, 2013
ABSTRACT This paper considers the problem of designing a multi-commodity network with single faci... more ABSTRACT This paper considers the problem of designing a multi-commodity network with single facility type subject to the requirement that under failure of any single edge, the network should permit a feasible flow of all traffic. We study the polyhedral structure of the problem by considering the multi-graph obtained by shrinking the nodes, but not the edges, in a k-partition of the original graph. A key theorem is proved according to which a facet of the k-node problem defined on the multi-graph resulting from a k-partition is also facet-defining for the larger problem under a mild condition. After reviewing the prior work on 2-partition inequalities, we develop two classes of 3-partition inequalities, and a large number of inequality classes based on 4-partitions. Proofs of facet-defining status for some of these are provided, while the rest are stated without proof. Computational results show that the addition of 3- and 4-partition inequalities results in substantial increase in the bound values compared to those possible with 2-partition inequalities alone. Problems of 35 nodes and 80 edges with fully dense traffic matrices have been solved optimally within a few minutes of computer time.
A set-partitioning-based exact algorithm for the vehicle routing problem
Networks, 1989
... Based on the above observations, the following strategies were used to improve computational ... more ... Based on the above observations, the following strategies were used to improve computational efficiency: ... Let column a, with cost cj represent a given route in the heuristic solution and Sj ... against the values using the above model for seven test problems, a combined correlation ...
k-Partition-based facets of the network design problem
Networks, 2006
ABSTRACT This article addresses the problem of designing a multicommodity network using facilitie... more ABSTRACT This article addresses the problem of designing a multicommodity network using facilities of a fixed capacity to satisfy a given set of traffic demands. This problem (called the NDP) arises primarily in the design of high-capacity telecommunication networks. The k-partition of the NDP graph is introduced which results in a smaller k-node NDP. The main result of the article is a theorem, which shows that a facet inequality of the k-node problem translates into a facet of the original problem under a fairly mild condition, that is, the subgraph of each component of the k-partition be connected. This theorem is utilized to show that 2- and 3-partition-based inequalities identified by previous researchers yield families of facets for the original NDP. The structure of the 4-node NDP is explored to derive three different classes of valid inequalities and the conditions under which they are facet defining. The effectiveness of these inequalities is indicated by the computational experience on a 10-node example. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(3), 123–139, 2006
Value of Information in a Capacitated Supply Chain
INFOR: Information Systems and Operational Research, 2008
Solving the team orienteering problem with nonidentical agents: A Lagrangian approach
Networks
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries
Networks
A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries
Operations Research Letters
New Valid Inequalities for the Optimal Communication Spanning Tree Problem
INFORMS Journal on Computing
Design of Capacitated Multicommodity Networks with Multiple Facilities
Operations Research, Mar 1, 2002
Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
Operations Research, Jun 1, 2012
ABSTRACT In this paper we consider the well-known fixed-charge transportation problem. To send an... more ABSTRACT In this paper we consider the well-known fixed-charge transportation problem. To send any flow from source s i to destination t j , we incur a unit variable shipping cost of c ij and a fixed cost f ij . Here we study the structure of the projection polyhedron of this problem, in the space of 0-1 variables associated with fixed charges, and we develop several classes of valid inequalities and derive conditions under which they are facet defining. In some cases, if the conditions are not satisfied, we show how they can be lifted to define facets. Several heuristics for generating and adding these facets are presented. Using these results, we develop a computationally effective algorithm for solving the problem. The computational results clearly indicate the usefulness of this approach.
Set Partitioning Approach to Vehicle Routing
Networks, 1989
Solving the two-facility network design problem with 3-partition facets
Networks, 2015
European Journal of Operational Research, 2014
In this paper we study the problem of designing a survivable telecommunication network with share... more In this paper we study the problem of designing a survivable telecommunication network with shared-protection routing. We develop a heuristic algorithm to solve this problem. Recent results in the area of global rerouting have been used to obtain very tight lower bounds for the problem. Our results indicate that in a majority of problem instances, the average gap between the heuristic solutions and the lower bounds is within 5%. Computational experience is reported on randomly generated problem instances with up to 35 nodes, 80 edges and 595 demand pairs and also on the instances available in SNDlib database.
Journal of Advances in Management Research, 2013
Purpose-The ocean transportation of automobiles is carried out by specialized Roll-on/Roll-off sh... more Purpose-The ocean transportation of automobiles is carried out by specialized Roll-on/Roll-off ships, which are designed to carry a large number of automobiles at a time. Many of these shipping companies have vertically integrated or collaborated with other logistics services providers to offer integrated maritime logistics solution to car manufacturers. The purpose of this study is to develop an optimization model to address the tactical level maritime logistics planning for such a company. Design/methodology/approach-The problem is formulated as a mixed integer linear program and we propose an iterative combined Ant colony and linear programming-based solution technique for the same. Findings-This paper can integrate the maritime transportation planning of internally managed cargoes with the inventory management at the loading and discharging ports to minimize supplychain cost and also maximize additional revenue through optional cargoes using same fleet of ships. Research limitations/implications-The mathematical model does not consider the variability in production and consumption of products across various locations, travel times between different nodes, etc. Practical implications-The suggested mathematical model to the supply-chain planning problem and solution technique can be considered in the development of decision support system for operations planning. Originality/value-This paper extends the maritime inventory routing model by considering simultaneous planning of optional cargoes with internally managed cargoes.
A Polyhedral Approach for Solving Two Facility Network Design Problem
Lecture Notes in Computer Science, 2011
ABSTRACT The paper studies the problem of designing telecommunication networks using transmission... more ABSTRACT The paper studies the problem of designing telecommunication networks using transmission facilities of two different capacities. The point-to-point communication demands are met by installing a mix of facilities of both capacities on the edges to minimize total cost. We consider 3-partitions of the original graph which results in smaller 3-node subproblems. The extreme points of this subproblem polyhedron are enumerated using a set of proposed theorems. We introduce a new approach for computing the facets of the 3-node problem based on polarity theory after obtaining the extreme points. The facets of the subproblem are then translated back to those of the original problem using an extended version of a previously known theorem. We have tested our approach on several randomly generated and real life networks. The computational results show that 3-partition facets reduce the integrality gap by approximately 30-50% compared to that provided by 2-partition facets. Also there is a substantial reduction in the size of the branch-and-bound tree if these facets are used.
Polyhedral structure of the 4-node network design problem
Networks, 2009
ABSTRACT This article studies the polyhedral structure of the 4-node network design problem (NDP)... more ABSTRACT This article studies the polyhedral structure of the 4-node network design problem (NDP). Using a theorem from the previous work of this author, the facets of the 4-node NDP can be translated into facets of larger size problems. The knowledge of complete polyhedral description of the 4-node NDP is important because it implies complete knowledge of 4-partition-based facets of larger NDPs. After reviewing the previously known facets of the 4-node NDP, a new class of facets is derived. An enumerative methodology is presented for determining whether a given set of inequalities provides a complete polyhedral description. By implementing this methodology in a computer code, it is determined that the known facets of the 4-node NDP indeed provide a complete polyhedral description of the problem. Working of the proof methodology is illustrated with examples, and the results of the computer enumeration are reported. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009
An Algorithm for Designing Survivable Networks
AT&T Technical Journal, 1989
The author considers the design of telecommunications networks using high-capacity transport faci... more The author considers the design of telecommunications networks using high-capacity transport facilities that can survive under a single-link failure scenario. The model considers three priority levels for circuits: high, normal, and low. Each high-priority circuit is assigned ...
A Benders' Partitioning Approach for Solving the Optimal Communication Spanning Tree Problem
Modeling, Computation and Optimization, 2009
Chapter 15 A Benders' Partitioning Approach for Solving the Optimal Communication Spanni... more Chapter 15 A Benders' Partitioning Approach for Solving the Optimal Communication Spanning Tree Problem Yogesh K. Agarwal Decision Sciences Group Indian Institute of Management, Lucknow 226013, India e-mail: yka@ iiml. ac. in Prabha Sharma Department of ...
Optimal relay placement in Wireless Sensor networks using node cut inequalities
2012 Fourth International Conference on Communication Systems and Networks (COMSNETS 2012), 2012
Optimal relay placement problem arises in wireless sensor network designs, where additional relay... more Optimal relay placement problem arises in wireless sensor network designs, where additional relay nodes are to be placed at a subset of given potential relay locations in order to transmit data from already existing source nodes to a base station known as root node. The relay nodes have a certain specified transmission radius and cannot transmit data beyond it. In
Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
Operations Research, 2012
ABSTRACT In this paper we consider the well-known fixed-charge transportation problem. To send an... more ABSTRACT In this paper we consider the well-known fixed-charge transportation problem. To send any flow from source s i to destination t j , we incur a unit variable shipping cost of c ij and a fixed cost f ij . Here we study the structure of the projection polyhedron of this problem, in the space of 0-1 variables associated with fixed charges, and we develop several classes of valid inequalities and derive conditions under which they are facet defining. In some cases, if the conditions are not satisfied, we show how they can be lifted to define facets. Several heuristics for generating and adding these facets are presented. Using these results, we develop a computationally effective algorithm for solving the problem. The computational results clearly indicate the usefulness of this approach.
Design of Survivable Networks Using Three- and Four-Partition Facets
Operations Research, 2013
ABSTRACT This paper considers the problem of designing a multi-commodity network with single faci... more ABSTRACT This paper considers the problem of designing a multi-commodity network with single facility type subject to the requirement that under failure of any single edge, the network should permit a feasible flow of all traffic. We study the polyhedral structure of the problem by considering the multi-graph obtained by shrinking the nodes, but not the edges, in a k-partition of the original graph. A key theorem is proved according to which a facet of the k-node problem defined on the multi-graph resulting from a k-partition is also facet-defining for the larger problem under a mild condition. After reviewing the prior work on 2-partition inequalities, we develop two classes of 3-partition inequalities, and a large number of inequality classes based on 4-partitions. Proofs of facet-defining status for some of these are provided, while the rest are stated without proof. Computational results show that the addition of 3- and 4-partition inequalities results in substantial increase in the bound values compared to those possible with 2-partition inequalities alone. Problems of 35 nodes and 80 edges with fully dense traffic matrices have been solved optimally within a few minutes of computer time.
A set-partitioning-based exact algorithm for the vehicle routing problem
Networks, 1989
... Based on the above observations, the following strategies were used to improve computational ... more ... Based on the above observations, the following strategies were used to improve computational efficiency: ... Let column a, with cost cj represent a given route in the heuristic solution and Sj ... against the values using the above model for seven test problems, a combined correlation ...
k-Partition-based facets of the network design problem
Networks, 2006
ABSTRACT This article addresses the problem of designing a multicommodity network using facilitie... more ABSTRACT This article addresses the problem of designing a multicommodity network using facilities of a fixed capacity to satisfy a given set of traffic demands. This problem (called the NDP) arises primarily in the design of high-capacity telecommunication networks. The k-partition of the NDP graph is introduced which results in a smaller k-node NDP. The main result of the article is a theorem, which shows that a facet inequality of the k-node problem translates into a facet of the original problem under a fairly mild condition, that is, the subgraph of each component of the k-partition be connected. This theorem is utilized to show that 2- and 3-partition-based inequalities identified by previous researchers yield families of facets for the original NDP. The structure of the 4-node NDP is explored to derive three different classes of valid inequalities and the conditions under which they are facet defining. The effectiveness of these inequalities is indicated by the computational experience on a 10-node example. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(3), 123–139, 2006
Value of Information in a Capacitated Supply Chain
INFOR: Information Systems and Operational Research, 2008