Tania Querido - Academia.edu (original) (raw)
Papers by Tania Querido
Springer eBooks, 2008
For an electronic timepiece arranged and adapted to give reminders there is provided a method for... more For an electronic timepiece arranged and adapted to give reminders there is provided a method for comparing a timekeeping state (1) with the contents of a register (2), a circuit (3) for applying the method and a utilization of such circuit. A programmable register (2) releases a signal whenever the contents of at least one counter (1) coincide with the contents of a portion of the register (2). In another portion of the register (2) is programmed the code of a state (-) which corresponding counters (1) will never attain under normal operations and the comparison (3) between the state of these counters (1) and that of said other portion of the register (2) is validated whatever may be the state. The comparison circuit (3) may be obtained from the arithmetic and logic units of a microprocessor as employed in a reminder giving timepiece.
One of the main goals in a transportation planning process is to achieve solutions for two classi... more One of the main goals in a transportation planning process is to achieve solutions for two classical problems: the traffic assignment problem, which minimizes the total travel delay among all travelers, and the toll pricing problem which settles, based on data derived from the first problem, the tolls that would collectively benefit all travelers and would lead to a user equilibrium solution. Acquiring precision for this framework is a challenge for large networks. In this article, we propose an approach to solve the two problems jointly, making use of a Hybrid Genetic Algorithm for the optimization of transportation network performance by strategically allocating tolls on some of the links. Since a regular transportation network may have thousands of intersections and hundreds of roads, our algorithm takes advantage of mechanisms for speeding up shortest path algorithms.
WORLD SCIENTIFIC eBooks, Aug 1, 2004
Applications of real-time distributed systems appear in many industrial areas. For such applicati... more Applications of real-time distributed systems appear in many industrial areas. For such applications the use of computer networks has increased in the last years, due to the trend of component automation through the use of embedded processors. In automobile industries, the controller area network (CAN) is a type of hard real-time distributed system designed to coordinate the demand of messages among in-vehicle electrical resources integrated with computational devices. CAN has been adapted by automotive manufacturers to operate ...
Rairo-operations Research, Jul 1, 1999
An algebraic and combinatorial approach to the study of the Quadratic Assignment Problem produced... more An algebraic and combinatorial approach to the study of the Quadratic Assignment Problem produced theoretical results that can be applied to (meta) heuristics to give them information about the problem structure, allowing the construction of algorithms. In this paper those results were applied to inform a Simulated Annealing-type heuristic (which we called RedInv-SA). Some results from tests with known literature instances are presented. Keywords: Quadratic assignment problem, meta-heuristics, simulated annealing, and combinatorial programming. Résumé.-Uneétude algébrique et combinatoire du Problème d'Affectation Quadratique a produit des résultats théoriques qui peuventêtre appliquésà des (méta)-heuristiques. Donnant des informations sur la structure du problème, ils conduisent de cette façonà la formulation d'algorithmes. Dans cet article, ces résultats ontété appliquésà l'information d'une heuristique de type Recuit Simulé, appelée RedInv-SA. Des résultats de l'application de l'algorithmeà des problèmes classiques de la littérature sont présentésà la fin de l'article.
Due to population growth and the massive production of automotive vehicles, traffic congestion pr... more Due to population growth and the massive production of automotive vehicles, traffic congestion problems have become larger and more common. This is a reality that governments are facing everywhere, even in medium sized cities that were not used to this scenario. However, despite the growth of the number of vehicles, traffic congestion can be lessened using different strategies. One possibility, that is explored in this research, is assigning tolls to roads, inducing users to take alternative paths, and thus better distributing the traffic across the road network. This problem is called the toll booth problem and is NP-hard. We propose mathematical formulations for variations of the toll booth problem, using two piecewise linear functions to approximate the congestion cost. We test these models on a set of real-world instances, and apply a previously proposed genetic algorithm to all instances. The experimental results show that the proposed piecewise linear functions approximates the original convex function quite well, and the genetic algorithm produces high quality solutions.
European Journal of Operational Research, 2007
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, ... more The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, models many real-life problems in several areas such as facilities location, parallel and distributed computing, and combinatorial data analysis. Combinatorial optimization ...
Discrete Applied Mathematics, 2002
In this work, we introduce the variance expression for quadratic assignment problem (QAP) costs. ... more In this work, we introduce the variance expression for quadratic assignment problem (QAP) costs. We also deÿne classes of QAP instances, described by a common linear relaxation form. The use of the variance in these classes leads to the study of isomorphism and allows for a deÿnition of a new di culty index for QAP instances. This index is then compared to a classical measure found in the literature.
European Journal Operational …, 2007
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, ... more The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, models many applications in several areas such as operational research, parallel and distributed computing, and combinatorial data analysis. Other optimization combinatorial problems such as the traveling salesman problem, maximal clique, isomorphism and graph partitioning can be formulated as a QAP. In this paper, we survey
RAIRO - Operations Research, 1999
ABSTRACT
European Journal of …, 2007
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, ... more The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, models many real-life problems in several areas such as facilities location, parallel and distributed computing, and combinatorial data analysis. Combinatorial optimization ...
One of the main goals in transportation planning is to achieve solutions for two classical proble... more One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment problem aims to minimize total travel delay among all travelers. Based on data derived from the first problem, the toll pricing problem determines the set of tolls and corresponding tariffs that would collectively benefit all travelers and would lead to a user equilibrium solution. Obtaining high-quality solutions for this framework is a challenge for large networks. In this paper, we propose an approach to solve the two problems jointly, making use of a biased random-key genetic algorithm for the optimization of transportation network performance by strategically allocating tolls on some of the links of the road network. Since a transportation network may have thousands of intersections and hundreds of road segments, our algorithm takes advantage of mechanisms for speeding up shortest-path algorithms.
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, ... more The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, models many applications in several areas such as operational research, parallel and distributed computing, and combinatorial data analysis. Other optimization combinatorial problems such as the traveling salesman problem, maximal clique, isomorphism and graph partitioning can be formulated as a QAP. In this paper, we survey some of the most important formulations available and classify them according to their mathematical sources. We also present a discussion on the theoretical resources used to define lower bounds for exact and heuristic algorithms, including those formulated according to metaheuristic strategies. Finally, we analyze the extension of the contributions brought about by the study of different approaches.
One of the main goals in a transportation planning process is to achieve solutions for two classi... more One of the main goals in a transportation planning process is to achieve solutions for two classical problems: the traffic assignment problem, which minimizes the total travel delay among all travelers, and the toll pricing problem which settles, based on data derived from the first problem, the tolls that would collectively benefit all travelers and would lead to a user equilibrium solution. Acquiring precision for this framework is a challenge for large networks. In this article, we propose an approach to solve the two problems jointly, making use of a Hybrid Genetic Algorithm for the optimization of transportation network performance by strategically allocating tolls on some of the links. Since a regular transportation network may have thousands of intersections and hundreds of roads, our algorithm takes advantage of mechanisms for speeding up shortest path algorithms.
Due to population growth and the massive production of automotive vehicles, traffic congestion pr... more Due to population growth and the massive production of automotive vehicles, traffic congestion problems have become larger and more common. This is a reality that governments are facing everywhere, even in medium sized cities that were not used to this scenario. However, despite the growth of the number of vehicles, traffic congestion can be lessened using different strategies. One possibility, that is explored in this research, is assigning tolls to roads, inducing users to take alternative paths, and thus better distributing the traffic across the road network. This problem is called the toll booth problem and is NP-hard. We propose mathematical formulations for variations of the toll booth problem, using two piecewise linear functions to approximate the congestion cost. We test these models on a set of real-world instances, and apply a previously proposed genetic algorithm to all instances. The experimental results show that the proposed piecewise linear functions approximates th...
One of the main goals in a transportation planning process is to achieve solutions for two classi... more One of the main goals in a transportation planning process is to achieve solutions for two classical problems: the traffic assignment problem, which minimizes the total travel delay among all travelers, and the toll pricing problem which settles, based on data derived from the first problem, the tolls that would collectively benefit all travelers and would lead to a user equilibrium solution. Acquiring precision for this framework is a challenge for large networks. In this article, we propose an approach to solve the two problems jointly, making use of a Hybrid Genetic Algorithm for the optimization of transportation network performance by strategically allocating tolls on some of the links. Since a regular transportation network may have thousands of intersections and hundreds of roads, our algorithm takes advantage of mechanisms for speeding up shortest path algorithms.
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, ... more The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, models many applications in several areas such as operational research, parallel and distributed computing, and combinatorial data analysis. Other optimization combinatorial problems such as the traveling salesman problem, maximal clique, isomorphism and graph partitioning can be formulated as a QAP. In this paper, we survey some of the most important formulations available and classify them according to their mathematical sources. We also present a discussion on the theoretical resources used to define lower bounds for exact and heuristic algorithms, including those formulated according to metaheuristic strategies. Finally, we analyze the extension of the contributions brought about by the study of different approaches.
Applications of real-time distributed systems appear in many industrial areas. For such applicati... more Applications of real-time distributed systems appear in many industrial areas. For such applications the use of computer networks has increased in the last years, due to the trend of component automation through the use of embedded processors. In automobile industries, the controller area network (CAN) is a type of hard real-time distributed system designed to coordinate the demand of messages among in-vehicle electrical resources integrated with computational devices. CAN has been adapted by automotive manufacturers to operate ...
International Journal of Operational Research, Mar 20, 2015
A controller area network (CAN) is a special-purpose communications system, used for real time co... more A controller area network (CAN) is a special-purpose communications system, used for real time control of embedded components in vehicles and other general purpose automation systems. A combinatorial algorithm based on network optimisation concepts is presented for scheduling messages on a CAN. The message scheduling (CANMS) problem in CAN requires that messages be allocated according to their priorities, to prevent excessive delays on important messages. The CANMS is an NP-hard problem. The objective of the ...
One of the main goals in a transportation planning process is to achieve solutions for two classi... more One of the main goals in a transportation planning process is to achieve solutions for two classical problems: the traffic assignment problem, which minimizes the total travel delay among all travelers, and the toll pricing problem which settles, based on data derived from the first problem, the tolls that would collectively benefit all travelers and would lead to a user equilibrium solution. Acquiring precision for this framework is a challenge for large networks. In this article, we propose an approach to solve the two problems jointly, making use of a Hybrid Genetic Algorithm for the optimization of transportation network performance by strategically allocating tolls on some of the links. Since a regular transportation network may have thousands of intersections and hundreds of roads, our algorithm takes advantage of mechanisms for speeding up shortest path algorithms.
Due to population growth and the massive production of automotive vehicles, traffic congestion pr... more Due to population growth and the massive production of automotive vehicles, traffic congestion problems have become larger and more common. This is a reality that governments are facing everywhere, even in medium sized cities that were not used to this scenario. However, despite the growth of the number of vehicles, traffic congestion can be lessened using different strategies. One possibility, that is explored in this research, is assigning tolls to roads, inducing users to take alternative paths, and thus better ...
Springer eBooks, 2008
For an electronic timepiece arranged and adapted to give reminders there is provided a method for... more For an electronic timepiece arranged and adapted to give reminders there is provided a method for comparing a timekeeping state (1) with the contents of a register (2), a circuit (3) for applying the method and a utilization of such circuit. A programmable register (2) releases a signal whenever the contents of at least one counter (1) coincide with the contents of a portion of the register (2). In another portion of the register (2) is programmed the code of a state (-) which corresponding counters (1) will never attain under normal operations and the comparison (3) between the state of these counters (1) and that of said other portion of the register (2) is validated whatever may be the state. The comparison circuit (3) may be obtained from the arithmetic and logic units of a microprocessor as employed in a reminder giving timepiece.
One of the main goals in a transportation planning process is to achieve solutions for two classi... more One of the main goals in a transportation planning process is to achieve solutions for two classical problems: the traffic assignment problem, which minimizes the total travel delay among all travelers, and the toll pricing problem which settles, based on data derived from the first problem, the tolls that would collectively benefit all travelers and would lead to a user equilibrium solution. Acquiring precision for this framework is a challenge for large networks. In this article, we propose an approach to solve the two problems jointly, making use of a Hybrid Genetic Algorithm for the optimization of transportation network performance by strategically allocating tolls on some of the links. Since a regular transportation network may have thousands of intersections and hundreds of roads, our algorithm takes advantage of mechanisms for speeding up shortest path algorithms.
WORLD SCIENTIFIC eBooks, Aug 1, 2004
Applications of real-time distributed systems appear in many industrial areas. For such applicati... more Applications of real-time distributed systems appear in many industrial areas. For such applications the use of computer networks has increased in the last years, due to the trend of component automation through the use of embedded processors. In automobile industries, the controller area network (CAN) is a type of hard real-time distributed system designed to coordinate the demand of messages among in-vehicle electrical resources integrated with computational devices. CAN has been adapted by automotive manufacturers to operate ...
Rairo-operations Research, Jul 1, 1999
An algebraic and combinatorial approach to the study of the Quadratic Assignment Problem produced... more An algebraic and combinatorial approach to the study of the Quadratic Assignment Problem produced theoretical results that can be applied to (meta) heuristics to give them information about the problem structure, allowing the construction of algorithms. In this paper those results were applied to inform a Simulated Annealing-type heuristic (which we called RedInv-SA). Some results from tests with known literature instances are presented. Keywords: Quadratic assignment problem, meta-heuristics, simulated annealing, and combinatorial programming. Résumé.-Uneétude algébrique et combinatoire du Problème d'Affectation Quadratique a produit des résultats théoriques qui peuventêtre appliquésà des (méta)-heuristiques. Donnant des informations sur la structure du problème, ils conduisent de cette façonà la formulation d'algorithmes. Dans cet article, ces résultats ontété appliquésà l'information d'une heuristique de type Recuit Simulé, appelée RedInv-SA. Des résultats de l'application de l'algorithmeà des problèmes classiques de la littérature sont présentésà la fin de l'article.
Due to population growth and the massive production of automotive vehicles, traffic congestion pr... more Due to population growth and the massive production of automotive vehicles, traffic congestion problems have become larger and more common. This is a reality that governments are facing everywhere, even in medium sized cities that were not used to this scenario. However, despite the growth of the number of vehicles, traffic congestion can be lessened using different strategies. One possibility, that is explored in this research, is assigning tolls to roads, inducing users to take alternative paths, and thus better distributing the traffic across the road network. This problem is called the toll booth problem and is NP-hard. We propose mathematical formulations for variations of the toll booth problem, using two piecewise linear functions to approximate the congestion cost. We test these models on a set of real-world instances, and apply a previously proposed genetic algorithm to all instances. The experimental results show that the proposed piecewise linear functions approximates the original convex function quite well, and the genetic algorithm produces high quality solutions.
European Journal of Operational Research, 2007
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, ... more The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, models many real-life problems in several areas such as facilities location, parallel and distributed computing, and combinatorial data analysis. Combinatorial optimization ...
Discrete Applied Mathematics, 2002
In this work, we introduce the variance expression for quadratic assignment problem (QAP) costs. ... more In this work, we introduce the variance expression for quadratic assignment problem (QAP) costs. We also deÿne classes of QAP instances, described by a common linear relaxation form. The use of the variance in these classes leads to the study of isomorphism and allows for a deÿnition of a new di culty index for QAP instances. This index is then compared to a classical measure found in the literature.
European Journal Operational …, 2007
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, ... more The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, models many applications in several areas such as operational research, parallel and distributed computing, and combinatorial data analysis. Other optimization combinatorial problems such as the traveling salesman problem, maximal clique, isomorphism and graph partitioning can be formulated as a QAP. In this paper, we survey
RAIRO - Operations Research, 1999
ABSTRACT
European Journal of …, 2007
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, ... more The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, models many real-life problems in several areas such as facilities location, parallel and distributed computing, and combinatorial data analysis. Combinatorial optimization ...
One of the main goals in transportation planning is to achieve solutions for two classical proble... more One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment problem aims to minimize total travel delay among all travelers. Based on data derived from the first problem, the toll pricing problem determines the set of tolls and corresponding tariffs that would collectively benefit all travelers and would lead to a user equilibrium solution. Obtaining high-quality solutions for this framework is a challenge for large networks. In this paper, we propose an approach to solve the two problems jointly, making use of a biased random-key genetic algorithm for the optimization of transportation network performance by strategically allocating tolls on some of the links of the road network. Since a transportation network may have thousands of intersections and hundreds of road segments, our algorithm takes advantage of mechanisms for speeding up shortest-path algorithms.
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, ... more The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, models many applications in several areas such as operational research, parallel and distributed computing, and combinatorial data analysis. Other optimization combinatorial problems such as the traveling salesman problem, maximal clique, isomorphism and graph partitioning can be formulated as a QAP. In this paper, we survey some of the most important formulations available and classify them according to their mathematical sources. We also present a discussion on the theoretical resources used to define lower bounds for exact and heuristic algorithms, including those formulated according to metaheuristic strategies. Finally, we analyze the extension of the contributions brought about by the study of different approaches.
One of the main goals in a transportation planning process is to achieve solutions for two classi... more One of the main goals in a transportation planning process is to achieve solutions for two classical problems: the traffic assignment problem, which minimizes the total travel delay among all travelers, and the toll pricing problem which settles, based on data derived from the first problem, the tolls that would collectively benefit all travelers and would lead to a user equilibrium solution. Acquiring precision for this framework is a challenge for large networks. In this article, we propose an approach to solve the two problems jointly, making use of a Hybrid Genetic Algorithm for the optimization of transportation network performance by strategically allocating tolls on some of the links. Since a regular transportation network may have thousands of intersections and hundreds of roads, our algorithm takes advantage of mechanisms for speeding up shortest path algorithms.
Due to population growth and the massive production of automotive vehicles, traffic congestion pr... more Due to population growth and the massive production of automotive vehicles, traffic congestion problems have become larger and more common. This is a reality that governments are facing everywhere, even in medium sized cities that were not used to this scenario. However, despite the growth of the number of vehicles, traffic congestion can be lessened using different strategies. One possibility, that is explored in this research, is assigning tolls to roads, inducing users to take alternative paths, and thus better distributing the traffic across the road network. This problem is called the toll booth problem and is NP-hard. We propose mathematical formulations for variations of the toll booth problem, using two piecewise linear functions to approximate the congestion cost. We test these models on a set of real-world instances, and apply a previously proposed genetic algorithm to all instances. The experimental results show that the proposed piecewise linear functions approximates th...
One of the main goals in a transportation planning process is to achieve solutions for two classi... more One of the main goals in a transportation planning process is to achieve solutions for two classical problems: the traffic assignment problem, which minimizes the total travel delay among all travelers, and the toll pricing problem which settles, based on data derived from the first problem, the tolls that would collectively benefit all travelers and would lead to a user equilibrium solution. Acquiring precision for this framework is a challenge for large networks. In this article, we propose an approach to solve the two problems jointly, making use of a Hybrid Genetic Algorithm for the optimization of transportation network performance by strategically allocating tolls on some of the links. Since a regular transportation network may have thousands of intersections and hundreds of roads, our algorithm takes advantage of mechanisms for speeding up shortest path algorithms.
The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, ... more The quadratic assignment problem (QAP), one of the most difficult problems in the NP-hard class, models many applications in several areas such as operational research, parallel and distributed computing, and combinatorial data analysis. Other optimization combinatorial problems such as the traveling salesman problem, maximal clique, isomorphism and graph partitioning can be formulated as a QAP. In this paper, we survey some of the most important formulations available and classify them according to their mathematical sources. We also present a discussion on the theoretical resources used to define lower bounds for exact and heuristic algorithms, including those formulated according to metaheuristic strategies. Finally, we analyze the extension of the contributions brought about by the study of different approaches.
Applications of real-time distributed systems appear in many industrial areas. For such applicati... more Applications of real-time distributed systems appear in many industrial areas. For such applications the use of computer networks has increased in the last years, due to the trend of component automation through the use of embedded processors. In automobile industries, the controller area network (CAN) is a type of hard real-time distributed system designed to coordinate the demand of messages among in-vehicle electrical resources integrated with computational devices. CAN has been adapted by automotive manufacturers to operate ...
International Journal of Operational Research, Mar 20, 2015
A controller area network (CAN) is a special-purpose communications system, used for real time co... more A controller area network (CAN) is a special-purpose communications system, used for real time control of embedded components in vehicles and other general purpose automation systems. A combinatorial algorithm based on network optimisation concepts is presented for scheduling messages on a CAN. The message scheduling (CANMS) problem in CAN requires that messages be allocated according to their priorities, to prevent excessive delays on important messages. The CANMS is an NP-hard problem. The objective of the ...
One of the main goals in a transportation planning process is to achieve solutions for two classi... more One of the main goals in a transportation planning process is to achieve solutions for two classical problems: the traffic assignment problem, which minimizes the total travel delay among all travelers, and the toll pricing problem which settles, based on data derived from the first problem, the tolls that would collectively benefit all travelers and would lead to a user equilibrium solution. Acquiring precision for this framework is a challenge for large networks. In this article, we propose an approach to solve the two problems jointly, making use of a Hybrid Genetic Algorithm for the optimization of transportation network performance by strategically allocating tolls on some of the links. Since a regular transportation network may have thousands of intersections and hundreds of roads, our algorithm takes advantage of mechanisms for speeding up shortest path algorithms.
Due to population growth and the massive production of automotive vehicles, traffic congestion pr... more Due to population growth and the massive production of automotive vehicles, traffic congestion problems have become larger and more common. This is a reality that governments are facing everywhere, even in medium sized cities that were not used to this scenario. However, despite the growth of the number of vehicles, traffic congestion can be lessened using different strategies. One possibility, that is explored in this research, is assigning tolls to roads, inducing users to take alternative paths, and thus better ...