This paper addresses the problem of routing multiple range constrained robots to service spatially distributed requests at specified time instants, while ensuring a connected information exchange network at all times. We discuss the feasibility aspects of such a connectivity constrained routing problem. In particular, we derive the minimum number of robots required to service such requests, and...

We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishable power resources, both path length and path energy cost are important metrics affecting sensor lifetime. In this paper, we model the formation of length and energy constrained paths using a game theoretic paradigm. ...

We study a new variant of the well-studied vehicle routing problem with time windows (VRPTW), called fragility-constrained VRPTW, which assumes that (1) capacity is organized in multiple identical stacks; (2) all items picked up at customer are either “fragile” or not; (3) no nonfragile can be put on top fragile item (the fragility constraint); and (4) en route load rearrangement possible. firs...

Arc routing problems consist basically of finding one or several routes traversing a given set arcs and/or edges that must be serviced. The Close-Enough Routing Problem, Generalized Directed Rural Postman does not assume customers are located at specific arcs, but can serviced by any arc subset. Real-life applications include for meter reading, in which vehicle equipped with receiver travels st...

Ad hoc networks are multi-hop wireless networks having dynamic topology due to node mobility. Routing protocols for such networks should be able to respond rapidly to topological changes. Designing and analyzing routing protocols for handling time-constrained messages in such dynamic environment is very crucial. A number of routing protocols have been proposed that deal with time-constrained me...

Multi-Constrained QoS routing in GMPLS (generalized multiprotocol label switching) network is to find an optimal path satisfying several constraints, such as bandwidth, cost and delay. The problem has been considered as a NP-Complete problem. Based on SRLG heuristic information, the paper provides a MPAS algorithm (Multi-constrained Precomputation Algorithm with SRLG), which includes the precom...