نتایج جستجو برای: multi constrained routing

تعداد نتایج: 580326  

Journal: :MONET 2010
Qing Yang Alvin S. Lim Shuang Li Jian Fang Prathima Agrawal

Multi-hop vehicle-to-vehicle communication is useful for supporting many vehicular applications that provide drivers with safety and convenience. Developing multi-hop communication in vehicular ad hoc networks (VANET) is a challenging problem due to the rapidly changing topology and frequent network disconnections, which cause failure or inefficiency in traditional ad hoc routing protocols. We ...

In the past decades, vehicle routing problem (VRP) has gained considerable attention for its applications in industry, military, and transportation applications. Vehicle routing problem with simultaneous pickup and delivery is an extension of the VRP. This problem is an NP-hard problem; hence finding the best solution for this problem which is using exact method, take inappropriate time, and th...

2013
G. L. Saini Deepak Dembla

Mobile ad hoc network is a self-directed structure of mobile nodes connected by wireless links. All nodes operate not only as an end system, but also as work as a router to forward the packets. Ad hoc wireless networks are characterized by multi-hop wireless connectivity, infrastructure less and habitually changing topology. It may be necessary for one mobile node to schedule other hosts for fo...

2006
Karen Smilowitz Guangming Zhang

This paper considers a variation of the Elementary Constrained Shortest Path Problem in which nodes are separated into subsets and a feasible path through the network may visit at most one node from each subset. We refer to this problem as the Multiple Choice Elementary Constrained Shortest Path Problem (MC-ECSPP). The MC-ECSPP arises as a subproblem in branch-and-price approaches for variation...

2015
Prosenjit Bose Rolf Fagerberg André van Renssen Sander Verdonschot

Let P be a set of n points in the plane and S a set of non-crossing line segments between vertices in P , called constraints. Two vertices are visible if the straight line segment connecting them does not properly intersect any constraints. The constrained θm-graph is constructed by partitioning the plane around each vertex into m disjoint cones, each with aperture θ = 2π/m, and adding an edge ...

Journal: :IEEE/ACM Transactions on Networking 2000

Farshid Samaei Mahdi Bashiri Reza Tavakkoli-Moghaddam

In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...

A. Salamatbakhsh, , M. Alinaghian, , M. Ghazanfari, , N. Norouzi, ,

This paper presents a novel multi-objective mathematical model of a periodic vehicle routing problem (PVRP) in a competitive situation for obtaining more sales. In such a situation, the reaching time to customers affects the sale amount therefore, distributors intend to service customers earlier than other rivals for obtaining the maximum sale. Moreover, a partial driver’s benefit is related...

Journal: :international journal of supply and operations management 2016
masoud rabbani mohammad-javad ramezankhani amir farshbaf-geranmayeh hamed farrokhi-asl

delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید