Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Camelia Chira"'
Publikováno v:
Neurocomputing. 150:58-66
This paper deals with the heterogeneous fixed fleet vehicle routing problem (HFFVRP) which is a generalization of the classical vehicle routing problem (VRP) in the sense that the fixed fleet of vehicles is assumed to be heterogeneous. The objective
Autor:
Camelia Chira, Anca Andreica
Publikováno v:
Applied Intelligence. 42:751-776
Permutation-based encoding is used by many evolutionary algorithms dealing with combinatorial optimization problems. An important aspect of the evolutionary search process refers to the recombination process of existing individuals in order to genera
Autor:
Camelia Chira, Ana L. C. Bazzan
Publikováno v:
ICCP
Traffic assignment aims to assign trips in a road network such that the travel time of each car is minimized given multiple alternative routes and origin-destination pairs. The number of alternative routes between two points considered in traffic ass
Publikováno v:
ITSC
Existing approaches to traffic assignment focus mainly on approximating the user equilibrium. However, nowadays, with the increasing number of traffic information reaching drivers, traffic authorities have a unique opportunity to try to recommend rou
Publikováno v:
Logic Journal of IGPL. 20:560-569
Combinatorial problems arising in diverse application domains and the growing complexity of many real-world situationsemphasize the need for efficient solving methods. One such problem is the bandwidth minimization problem having broadapplications i
Autor:
Petrica C. Pop, Camelia Chira
Publikováno v:
IEEE Congress on Evolutionary Computation
In this paper, we describe a hybrid approach based on the use of genetic algorithms for solving the Clustered Vehicle Routing Problem, denoted by CluVRP. The problem studied in this work is a generalization of the classical Vehicle Routing Problem (V
Autor:
Anca Andreica, Camelia Chira
Publikováno v:
ISDA
Resource-Constrained Project Scheduling is an NP-hard problem very attractive for researchers due to its large area of applications. This paper concentrates on the evolutionary approaches to Resource-Constrained Project Scheduling based on permutatio
Autor:
Nima Hatami, Camelia Chira
Publikováno v:
Intelligent Data Engineering and Automated Learning-IDEAL 2012 ISBN: 9783642326387
IDEAL
IDEAL
The problem of predicting a protein structure with minimum energy from a sequence of amino acids has a significant importance in biology. This is a computationally challenging problem being NP-hard even in simplified lattice protein models such as th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f05f1e1e5c8837344e492ce77b4d2c19
https://doi.org/10.1007/978-3-642-32639-4_23
https://doi.org/10.1007/978-3-642-32639-4_23
Autor:
Camelia Chira, Anca Gog
The Travelling Salesman Problem (TSP) is one of the most widely studied optimization problems due to its many applications in domains such as logistics, planning, routing, and scheduling. Approximation algorithms to address this NP-hard problem inclu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7acacbf438c4f17dc2615cc832ae8ed
https://doi.org/10.4018/978-1-4666-0297-7.ch010
https://doi.org/10.4018/978-1-4666-0297-7.ch010
Publikováno v:
ISDA
The real-world problem of Urban Bicycles Renting Systems (UBRS) in a city requires the optimization of vehicle routes connecting several bicycle base stations and storage centers. This problem can be modeled as a capacitated Vehicle Routing Problem (