A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Filters
Mathematical models of the delay constrained routing problem
2006
Algorithmic Operations Research
unpublished
Preserved Fulltext
We give a convex relaxation of the delay constrained routing problem and present some ways to get upper and lower bounds on the problem. ...
However, more quality of service constraints such as delay constraints, may be imposed and the routing problem becomes difficult to solve. ...
Solution methods for lower bounds The aim of the paper was to present some mathematical models of the delay constrained routing problem that can be handled by convex programming. ...
fatcat:lg6qxvqbjzftdkqqnsgzpzbsiq
Mathematical and Numerical Modeling of Information Dissemination in Mobile Networks
2013
Journal of Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The aforementioned constrained optimization problems are solved by a proposed rough penalty genetic algorithm and achieve near-optimal solutions for a variety of multicast routing problems. ...
The first group of papers addresses issues in the area of information dissemination via mathematical modelling approaches. ...
In addition, we sincerely appreciate the editorial board members of this journal for their warm support throughout the preparation of this special issue. ...
doi:10.1155/2013/590872
fatcat:oxypt54xibg2rofrsyti5f7ovy
An Optimization Model for Large Scale Airspace
2016
International Journal of Modeling and Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a new mathematical model that finds optimal routes by taking into account delay cost, controller's capacity, departure and arrival capacities of an airport, waypoints capacity, routes ...
The model can be applied to large scale airspace like ASEAN airspace. ...
That is why this paper proposes a mathematical model which can be used to solve congested problems in large scale. The model to find optimal routes for the flights in large scale has been developed. ...
doi:10.7763/ijmo.2016.v6.509
fatcat:eerkby5l7re2ni4hostuxkasfi
Challenges and trends in wireless ubiquitous computing systems
2011
Personal and Ubiquitous Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the last decade, the Internet paradigm has been evolving toward a new frontier with the emergence of ubiquitous and pervasive systems, including wireless sensor networks, ad hoc networks, RFID systems ...
In fact, while the initial purpose of the Internet was to interconnect computers to share digital data at large scale, the current tendency is to enable ubiquitous and pervasive computing to control everything ...
delay is constrained to a certain bound (known as the multicast endto-end delay problem), but also the delay variation on the different paths should be kept within a definite limit (known as the delay-variation ...
doi:10.1007/s00779-011-0368-2
fatcat:2h37estnxvc3rp3aumf7w3rfde
Mathematical Rescheduling Models For Railway Services
2013
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This paper presents the review of past studies concerning mathematical models for rescheduling passenger railway services, as part of delay management in the occurrence of railway disruption. ...
Many past mathematical models highlighted were aimed at minimizing the service delays experienced by passengers during service disruptions. ...
ACKNOWLEDGMENT The work presented in this paper is part of the Research Intensive Faculty (RIF) project funded by Research Management Institute of Universiti Teknologi MARA Malaysia. ...
doi:10.5281/zenodo.1086721
fatcat:nj2o6ekd4rayrbg5xzhtxbqd2a
Static traffic assignment with residual queues and spillback
2019
Transportation Research Procedia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Peer-review under responsibility of the scientific committee of the 23rd International Symposium on Transportation and Traffic Theory. ...
Several mathematical problem formulations of capacity constrained static TA models have appeared in the literature. ...
Thomson and Payne (1975) showed that queuing delays in static TA models formulated as a side-constrained mathematical optimisation problems are related to the Lagrange multipliers associated with the ...
doi:10.1016/j.trpro.2019.05.034
fatcat:2tm3z55csjfyfergkiadjdlpu4
Optimized Quality of Service for Real-Time Wireless Sensor Networks Using a Partitioning Multipath Routing Approach
2013
Journal of Computer Networks and Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We propose a novel mathematical model for quality of service (QoS) route determination that enables a sensor to determine the optimal path for minimising resource use while satisfying the required QoS ...
The proposed mathematical model uses the Lagrangian relaxation mixed integer programming technique to define critical parameters and appropriate objective functions for controlling the adaptive QoS constrained ...
Section 3.3 provides more details on the constrained QoS routing modeling for the optimization problem. Section 4 discusses the performance evaluation of the derivation of the mathematical modeling. ...
doi:10.1155/2013/497157
fatcat:ushrom4k2bcnlnrdatjwr6uooy
Routing in Degree-Constrained FSO Mesh Networks
2008
2008 Second International Conference on Future Generation Communication and Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This paper addresses the routing problem in packet switching free-space optical (FSO) mesh networks. ...
Our proposed minimum hop count with load-balancing (MHLB) routing algorithm is based on the number of hops between the source and the destination node to route the traffic. ...
The problem becomes finding an optimal routing strategy that minimizes the average delay T; therefore it's a flow assignment (FA) problem [12] . The FA problem can be stated as follows. ...
doi:10.1109/fgcn.2008.31
dblp:conf/fgcn/HuVS08
fatcat:wmw7jo6qgnebrcfgzheoxo7gxm
Particle Swarm Optimization for Multi-constrained Routing in Telecommunication Networks
2011
International Journal of Computer Network and Information Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper firstly sets up a multi constrained QoS routing model and constructs the fitness value function by transforming the QoS constraints with a penalty function. ...
By our analysis, the QoS routing is the optimization problem under the satisfaction of multiple QoS constraints. ...
Mathematical model Considering the network as a graph G (V,E),where. ...
doi:10.5815/ijcnis.2011.04.02
fatcat:xwnkj3zyk5hmjcobmm3oyqhrja
Utilizing Joint Routing and Capacity Assignment Algorithms to Achieve Inter- and Intra-Group Delay Fairness in Multi-Rate Multicast Wireless Sensor Networks
2013
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper; a solution to the wireless sensor network multicasting problem is proposed in which a mathematical model that provides services to accommodate delay fairness for each subscriber is constructed ...
When resources are constrained and when the number of receivers increases rapidly, how the sensor network can provide good QoS (measured as end-to-end delay) becomes a very critical problem. ...
Acknowledgement This work was supported by the National Science Council, Taiwan, Republic of China (Grant Nos. NSC 100-2221-E-002-174). ...
doi:10.3390/s130303588
pmid:23493123
pmcid:PMC3658763
fatcat:c37euw3vpnclnmacua5rk6hyie
A Decentralized Routing Control Scheme for Data Communication Networks
2013
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Taking the physical constraints on the data flow and the network-induced delays into consideration, the decentralized routing control problem is reformulated as a constrained control problem, and the restriction ...
This paper studies the decentralized routing control of data communication networks. ...
Several researchers have also attempted to address the problem of delay-constrained routing in recent years [13] [14] [15] [16] [17] [18] [19] [21] [22] [23] [24] . ...
doi:10.1155/2013/648267
fatcat:yvx3wngt6zf7rpsgtb5zlq6hey
Multicast Routing Problem in Communication Networks: State of the Art
2019
Journal of Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
MATHEMATICAL MODELING OF THE ROUTING PROBLEM This section introduces the mathematicalmodeling of the routing problem, as well as all the related notions. ...
subject, and make a comprehensive survey and comparisons of different techniques employed in or proposed for routing problem. ...
The present work is organized as follows: in the section 2, we will describe the mathematical modeling of a routing problem. In section 3, a description of the routing theory is given. ...
doi:10.12720/jcm.14.5.408-422
fatcat:t4gpr4q4gjadlf6h7m54ty6fju
A New Hybrid GRASP with the Pilot Method Forthe Delay-Constrained Multicast Routing Problem
2013
Advanced Materials Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
As the underpinning mathematical model, the constrained minimum Steiner tree problem in graphs is a well-known NP-complete problem. ...
In this paper we investigate a new hybrid GRASP (Greedy Randomized Adaptive Search Procedure) approach where a pilot method is applied to further enhance the search for the Delay-Constrained Least-Cost ...
The Delay-Constrained Least-Cost (DCLC) multicast routing problem can be seen as a delay-constrained Steiner tree, which is also NPcomplete [6] [7] [8] . ...
doi:10.4028/www.scientific.net/amr.756-759.3647
fatcat:fq6edd7sjvhnrnsyg53ltj5gfy
The Optimization Model and Empirical Analysis for Vehicle Routing Problems with Time Windows Based on C-W Algorithm
[chapter]
2012
LISS 2012
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
distribution system of S company to find the vehicle routing problems. ...
Considering the vehicle routing problems with time window restriction, we combine the typical practical situation to establish the proper model. Based on c-w saving algorithm. ...
The vehicle routing problem of mathematical modeling is as follows: Objective function: A brief description of the above formula: Objective function(3-1) is the function for minimum cost, which the first ...
doi:10.1007/978-3-642-32054-5_38
fatcat:p7fba43anbd6zmdyavqcdizcwi
Side constrained traffic equilibrium models— analysis, computation and applications
1999
Transportation Research Part B: Methodological
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Second, we show that the side constrained problem is equivalent to an equilibrium model with travel cost functions properly adjusted to take into account the information introduced through the side constraints ...
We study a general convexly side constrained trac equilibrium assignment model, and establish several results pertaining to the above described areas of application. ...
Acknowledgements The research leading to this paper started while the second author was visiting the Department of Mathematics, University of York, Heslington, York, UK. ...
doi:10.1016/s0191-2615(98)00024-1
fatcat:nlygiha5frdvnj6z6xxguwukl4
« Previous
Showing results 1 — 15 out of 29,503 results