Daniel Riera

According to our database1, Daniel Riera authored at least 25 papers between 2002 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Improving the Location of Roadside Assistance Resources Through Incident Forecasting.
Proceedings of the Computational Logistics - 12th International Conference, 2021

Metaheuristics in Telecommunication Systems: Network Design, Routing, and Allocation Problems.
IEEE Syst. J., 2018

A simheuristic algorithm for solving the arc routing problem with stochastic demands.
J. Simulation, 2018

Gamification: a systematic review of design frameworks.
J. Comput. High. Educ., 2017

ACO and CP Working Together to Build a Flexible Tool for the VRP.
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

A Literature Review of Gamification Design Frameworks.
Proceedings of the 7th International Conference on Games and Virtual Worlds for Serious Applications, 2015

A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times.
Simul. Model. Pract. Theory, 2014

On the verification of UML/OCL class diagrams using constraint programming.
J. Syst. Softw., 2014

Rich Vehicle Routing Problem: Survey.
ACM Comput. Surv., 2014

On the use of biased randomization and simheuristics to solve vehicle and arc routing problems.
Proceedings of the 2014 Winter Simulation Conference, 2014

Multi-start Approach for Solving an Asymmetric Heterogeneous Vehicle Routing Problem in a Real Urban Context.
Proceedings of the ICORES 2013, 2013

Development and assessment of the SHARP and RandSHARP algorithms for the arc routing problem.
AI Commun., 2012

SIM-RandSHARP: a hybrid algorithm for solving the Arc Routing Problem with Stochastic Demands.
Proceedings of the Winter Simulation Conference, 2012

On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics.
J. Oper. Res. Soc., 2011

Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the Vehicle Routing Problem.
Ann. Math. Artif. Intell., 2011

Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem.
Proceedings of the 17th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2010

Verifying UML/OCL Operation Contracts.
Proceedings of the Integrated Formal Methods, 7th International Conference, 2009

A Simulation-based Methodology to Assist Decision-makers in Real Vehicle Routing Problems.
Proceedings of the ICEIS 2009, 2009

Applying Simulation and Reliability to Vehicle Routing Problems with Stochastic Demands.
Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2009

UMLtoCSP: a tool for the formal verification of UML/OCL models using constraint programming.
Proceedings of the 22nd IEEE/ACM International Conference on Automated Software Engineering (ASE 2007), 2007

UMLtoCSP: Una herramienta para la verificación de modelos UML/OCL mediante Constraint Programming.
Proceedings of the XII Jornadas de Ingeniería del Software y Bases de Datos (JISBD 2007), 2007

A Petri Nets-Based Scheduling Methodology for Multipurpose Batch Plants.
Simul., 2005

Optimization of Logistic and Manufacturing Systems through Simulation: A Colored Petri Net-Based Methodology.
Simul., 2004

An Improved Hybrid Model for the Generic Hoist Scheduling Problem.
Ann. Oper. Res., 2002

PN to CSP Methodology: Improved Bounds.
Proceedings of the Topics in Artificial Intelligence, 5th Catalonian Conference on AI, 2002