Page 1 Next

Displaying 1 – 20 of 111

Showing per page

A branch-and-price algorithm for the windy rural postman problem

Hasan Murat Afsar, Nicolas Jozefowiez, Pierre Lopez (2012)

RAIRO - Operations Research

In this paper, we propose an exact solution method for the windy rural postman problem (WRPP). The motivation to study this problem comes from some real-life applications, such as garbage collecting in a predefined sector with hills, where the traversing or the servicing speed can change following the direction. We present a Dantzig-Wolfe decomposition and a branch-and-price algorithm to solve the WRPP. To the best of our knowledge, Dantzig-Wolfe decomposition has never been used to solve that problem....

A hybrid approach for scheduling transportation networks

Mahjoub Dridi, Imed Kacem (2004)

International Journal of Applied Mathematics and Computer Science

In this paper, we consider a regulation problem of an urban transportation network. From a given timetable, we aim to find a new schedule of multiple vehicles after the detection of a disturbance at a given time. The main objective is to find a solution maximizing the level of service for all passengers. This problem was intensively studied with evolutionary approaches and multi-agent techniques, but without identifying its type before. In this paper, we formulate the problem as a classical one...

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

Lixin Miao, Qingfang Ruan, Kevin Woghiren, Qi Ruo (2012)

RAIRO - Operations Research

This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a central depot. In spite of its clear practical significance...

A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints

Lixin Miao, Qingfang Ruan, Kevin Woghiren, Qi Ruo (2012)

RAIRO - Operations Research

This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a central depot. In spite of its clear practical significance...

A memetic algorithm for the vehicle routing problem with time windows

Nacima Labadi, Christian Prins, Mohamed Reghioui (2008)

RAIRO - Operations Research

This article deals with the vehicle routing problem with time windows (VRPTW). This problem consists in determining a least-cost set of trips to serve customers during specific time windows. The proposed solution method is a memetic algorithm (MA), a genetic algorithm hybridised with a local search. Contrary to most papers on the VRPTW, which minimize first the number of vehicles, our method is also able to minimize the total distance travelled. The results on 56 classical instances are compared...

A multi-destination daily carpooling problem and an ant colony based resolution method

Yuhan Guo, Gilles Goncalves, Tienté Hsu (2013)

RAIRO - Operations Research - Recherche Opérationnelle

The rising car usage deriving from growth in jobs and residential population causes air pollution, energy waste and consumption of people’s time. Public transport cannot be the only answer to this increasing transport demand. Carpooling, which is based on the idea that sets of car owners pick up colleagues while driving to or from the workplace, has emerged to be a viable possibility for reducing private car usage in congested areas. Its actual practice requires a suitable information system support...

A short note on marginal analysis of a transportation problem (Retraction article)

M. Sreenivas, T. Srinivas (2009)

RAIRO - Operations Research

Editorial from the Editor-in-Chief regarding this case of plagiarismPhilippe Mahey 1 Introduction Plagiarism is a plague that any scientific publication in any discipline should fight and eradicate all over the world. Unfortunately, if, on the one hand, the powerful search engines available on the web have helped referees to identify most of the cases, the increasing number of publications have on the other hand facilitated that dubious practice and the number of cases have increased. The case...

A simplex trained neural network-based architecture for sensor fusion and tracking of target maneuvers

Yee Chin Wong, Malur K. Sundareshan (1999)

Kybernetika

One of the major applications for which neural network-based methods are being successfully employed is in the design of intelligent integrated processing architectures that efficiently implement sensor fusion operations. In this paper we shall present a novel scheme for developing fused decisions for surveillance and tracking in typical multi-sensor environments characterized by the disparity in the data streams arriving from various sensors. This scheme employs an integration of a multilayer neural...

A threshold accepting approach to the open vehicle routing problem

Christos D. Tarantilis, George Ioannou, Chris T. Kiranoudis, Gregory P. Prastacos (2004)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper we consider the operational planning problem of physical distribution via a fleet of hired vehicles, for which the travelling cost is solely a function of the sequence of locations visited within all open delivery routes, while vehicle fixed cost is inexistent. The problem is a special class of vehicle routing and is encountered in the literature as the Open Vehicle Routing Problem (OVRP), since vehicles are not required to return to the depot. The goal is to distribute in an optimal...

A threshold accepting approach to the Open Vehicle Routing problem

Christos D. Tarantilis, George Ioannou, Chris T. Kiranoudis, Gregory P. Prastacos (2010)

RAIRO - Operations Research

In this paper we consider the operational planning problem of physical distribution via a fleet of hired vehicles, for which the travelling cost is solely a function of the sequence of locations visited within all open delivery routes, while vehicle fixed cost is inexistent. The problem is a special class of vehicle routing and is encountered in the literature as the Open Vehicle Routing Problem (OVRP), since vehicles are not required to return to the depot. The goal is to distribute in an...

ABR traffic control over multisource single-bottleneck ATM networks

Andrzej Bartoszewicz, Tomasz Molik (2004)

International Journal of Applied Mathematics and Computer Science

The problem of flow control in fast, connection-oriented communication networks supporting the traffic generated by multiple sources is considered. A novel sampled time strategy governing the behaviour of the sources is proposed. The strategy combines the Smith principle with the conventional sampled time proportional controller. It guarantees an equal resource allocation between various users, full bottleneck link utilisation and no cell loss in the controlled network. Consequently, the need for...

Advanced approach for the public transportation regulation system based on cybercars

Asma Melki, Slim Hammadi, Yves Sallez, Thierry Berger, Christian Tahon (2010)

RAIRO - Operations Research

In the last decade, the authorities require the use of safe, comfortable vehicles to assure a door to door aspect with respect of environment in the urban context. In this paper, we propose an advanced approach of transport regulation where we integrate cybercars into a regulation process as an alternative in disruption cases. For that, we propose an ITS architecture including public transportation and cybercars into the same framework. We will show that collaboration between these two systems...

Affectation de véhicules aux routes dans un système de transport multi-école.

Ana M. Cobes, Albert Corominas (1990)

Qüestiió

Este artículo describe una parte del sistema TRESCA para la organización del transporte escolar en Andorra. Una vez determinadas las rutas a ofrecer, conviene asignarles los vehículos para minimizar los costes. El algoritmo que se ha concebido establece las secuencias de rutas de acuerdo con el modelo de Orloff, con una programación lineal entera y con un subalgoritmo glotón.

An analysis of supply chain decisions with asymmetrical retailers : effects of disruptions and static service cost on coordination mechanism

Kebing Chen, Lei Yang, Yanxia Liu (2012)

RAIRO - Operations Research - Recherche Opérationnelle

The risk of demand or production cost disruption is one of the challenging problems in the supply chain management. This paper explores a generalized supply chain game model incorporating the possible disruptions. We find that a nonlinear Grove wholesale price scheme can fully coordinate such a supply chain even when both market demand and production cost are disrupted. The nonlinear Grove wholesale price scheme has three sides to coordinate the decision behavior of the players. One is that the...

Currently displaying 1 – 20 of 111

Page 1 Next